Bookmarks Menu
- Recently Bookmarked
- Recent Tags
Mozilla Firefox
- Recently Bookmarked
- Recent Tags
- category theory - Unique up to unique isomorphism - Mathematics Stack Exchange
- Search · user:lolisa state:open
- Build software better, together.
- Gradual Typing Bibliography
- Gradual Typing Bibliography :
- notation - How does slice category help create functor? - Mathematics Stack Exchange
- Non-well-founded sets - 00000056.pdf
- Algebraic structure - Wikipedia, the free encyclopedia
- Quasi-category - Wikipedia, the free encyclopedia
- 2-category - Wikipedia, the free encyclopedia
- Category of small categories - Wikipedia, the free encyclopedia
- Why is every category not isomorphic to its opposite? - Mathematics Stack Exchange
- Communicating sequential processes - Wikipedia, the free encyclopedia
- GKminiTT.pdf
- Homotopy Type Theory
- CSC2535S : lectures
- CSC2535S : lectures
- CSC2515 Fall 2008: lectures
- CSC2515 : lectures
- Computer Science 438H/2404H -- Winter 2014
- The Next Stage of Staging | Lambda the Ultimate
- Generative Programming
- Generating efficient and reliable code
- Multi-stage programming with functors and monads
- CiteSeerX — Multi-Stage Programming: Its Theory and Applications
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): MetaML is a statically typed functional programming language with special support for program generation. In addition to providing the standard features of contemporary programming languages such as Standard ML, MetaML provides three staging annotations. These staging annotations allow the construction, combination, and execution of object-programs.
- A Gentle Introduction to Multi-stage Programming - Springer
- dspg04a.pdf
- StagingNG.pdf
- thesis.dvi - thesis.pdf
- Issues For Language Designers
- Predicate transformer semantics - Wikipedia, the free encyclopedia
- CHARITY - Home Page
- index
- OBJ (programming language) - Wikipedia, the free encyclopedia
- OBJ Family: OBJ3 CafeOBJ Maude Kumo FOOPS Eqlog
- dependent-type-providers.pdf
- make.dvi - expressingcomputational.pdf
- Clean
- Uniqueness type - Wikipedia, the free encyclopedia
- Substructural type system - Wikipedia, the free encyclopedia
- Universe Polymorphism and Typical Ambiguity | The n-Category Café
- - 搜索结果 - 哔哩哔哩弹幕视频网 - ( ゜- ゜)つロ 乾杯~ - bilibili
- bilibili是一家弹幕站点,大家可以在这里找到许多的欢乐.
- http://eb.host.cs.st-andrews.ac.uk/writings/idris-tutorial.pdf
- fmcad2013.pdf
- 1000+ Beginner Programming Projects & Practice problems | Programmer's Motivation
- I have come up with a big list of beginner programming projects / programming tasks (Aggregated from many sources) from which you can choose your first
- cppcon | The C++ Conference
- A theory of changes for higher-order languages — incrementalizing λ-calculi by static differentiation | Lambda the Ultimate
- mod1.pdf
- Logic in Computer Science: Modeling and reasoning about systems - 必应
- https://awelonblue.wordpress.com/about/
- A Case for Gestures/Visualizations and Against Concrete Syntax | Lambda the Ultimate
- ifl2014_submission_32.pdf
- Lattice (order) - Wikipedia, the free encyclopedia
- The Type Theory Podcast | A podcast about type theory
- The mystery of the tower revealed
- Toward Absolutely Efficient Gradual Typing
- Abstract
- Computer Science Books Online
- Computer science books for free online reading: algorithms, artificial intelligence, communication, signal processing, information theory, modeling, simulation, software engineering, systems analysis and design.
- Resources for Programming Language Research
- Logical Frameworks
- Main Page - The Twelf Project
- ACM SIGPLAN History of programming languages Conferences 
- "Session Types as Intuitionistic Linear Propositions" by Luis Caires and Frank Pfenning
- Several type disciplines for π-calculi have been proposed in which linearity plays a key role, even if their precise relationship with pure linear logic is still not well understood. In this paper, we introduce a type system for the π-calculus that exactly corresponds to the standard sequent calculus proof system for dual intuitionistic linear logic. Our type system is based on a new interpretation of linear propositions as session types, and provides the first purely logical account of all (both shared and linear) features of session types. We show that our type discipline is useful from a programming perspective, and ensures session fidelity, absence of deadlocks, and a tight operational correspondence between π-calculus reductions and cut elimination steps.
- lambdaInria.pptx - lambdaInria.pdf
- Robert Harper's Home Page
- Yann LeCun: What's so great about "Extreme Learning Machines"? : MachineLearning
- Yann LeCun's thoughts about ELMs: > What's so great about "Extreme Learning Machines"? > > There is an interesting sociological phenomenon...
- Dependent Case Analysis in Coq without Axioms
- Social processes and proofs of theorems and programs
- leroy : Leroy-compcert-06
- CSE 506 / projects
- capabilities.dvi - capabilities.pdf
- Garbage collection via dynamic type inference - A formal treatment - - Springer
- Touhou Music
- reddit: the front page of the internet
- Essential Incompleteness of Arithmetic Verified by Coq
- 论灵魂的激情 - 必应
- BasicTypechecking.pdf
- milner-damas_principal_types.pdf
- Sequent calculus presentation of modal logic? : logic
- I'm interested in modal logic, but I can't seem to find any good textbooks that provide a sequent calculus for it. Is anyone aware of any such...
- Formal verification of monad transformers
- Archive of Formal Proofs
- Inductive programming - Wikipedia, the free encyclopedia
- Bor-Yuh Evan Chang
- Zhenjiang Hu's home page
- Zhong Shao's Home Page
- Luca Cardelli
- Research in Programming Languages | Tagide
- Callisto: building a minimalist language on "versioned objects" | Lambda the Ultimate
- Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
- 15-bidirectional.pdf
- popl04.pdf
- Tridirectional typechecking - viewcontent.cgi
- page000
- http://lambda-the-ultimate.org/taxonomy/term/21
- A linear format for resolution - Springer
- CiteSeerX — Behavioral Types for Component-Based Design," Memorandum UCB/ERL
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract. We present a framework to extend the concept of type systems in programming languages to capture the dynamic interaction in component-based design, including the communication protocols between components. Our system is based on a light-weight formalism- interface automata. We first propose some extensions to the theory of interface automata to make them more powerful, then use the extended theory to establish a behavioral-level type system. In our system, the interaction types and the dynamic behavior of components are defined using interface automata, and type checking, which checks the compatibility of a component with a certain interaction type, is conducted through automata composition. Our type system is polymorphic in that a component may be compatible with more than one interaction type. We show that a subtyping relation exists among various interaction types and that this relation can be described using a partial order. This behavioral type order can be used to facilitate the design of polymorphic components and simplify type checking. In addition to static type checking, we also propose to extend the use of interface automata to the on-line reflection of component states and to run-time type checking. We illustrate our framework using a component-based design environment, Ptolemy II, and discuss the trade-offs in the design of behavioral type systems.
- CiteSeerX — To appear in Formal Aspects of Computing Journal, special issue on “Semantic Foundations of Engineering Design Languages. ” This version: November 10, 2003. A Behavioral Type System and Its Application in Ptolemy II
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract. Interface automata [deH01] have been introduced as an interface theory [deH01a] capable of functioning as a behavioral type system. Behavioral type systems describe dynamic properties of components and their compositions. Like traditional (data) type systems, behavioral type systems can be used to check compatibility of components. In this paper, we use interface automata to devise a behavioral type system for Ptolemy II, leveraging the contravariant and optimistic properties of interface automata to achieve behavioral subtyping and polymorphism. Ptolemy II is a software framework supporting concurrent component composition according to diverse models of computation. In this paper, we focus on representing the communication protocols used in component communication within the behavioral type system. In building this type system, we identify two key limitations in interface automata formalisms; we overcome these limitations with two extensions, transient states and projection automata. In addition to static type checking, we also propose to extend the use of interface automata to the on-line reflection of component states and to run-time type checking, which enable dynamic component creation, morphing application structure, and admission control. We discuss the trade-offs in the design of behavioral type systems. Keywords: Behavioral type; Behavioral subtyping; Component-based design; Interface automata; Polymorphism; Alternating simulation
- Computational type theory - Scholarpedia
- C&C - Bidirectional Type Checkers for λ→ and λΠ
- Robert Atkey: An Algebraic Approach to Typechecking and Elaboration : types
- reddit: the front page of the internet
- Slides for “An Algebraic Approach to Typechecking and Elaboration”
- A New constructive logic : classical logic - document
- Summer School on Generic and Effectful Programming
- Genetic algorithms for structural editing - Springer
- Workshop on Type Inference and Automated Proving
- Pure Type Systems with Judgemental Equality | Robin Adams - Academia.edu
- By Robin Adams in Type Theory and Pure Type Systems. In a typing system, there are two approaches that may be taken to the notion of equality. One can use some external relation of convertibility defined on the terms of the grammar, such as
- Bob_Atkey_-_An_Algebraic_Approach_to_Typechecking_and_Elaboration.pdf
- Templates as first-class citizens in C++11 | Victor Laskin's Blog
- fast-cheap.pdf
- The Unreasonable Effectiveness of Recurrent Neural Networks
- Musings of a Computer Scientist.
- PYPL PopularitY of Programming Language index
- PYPL index popularity of programming language
- Undelimited continuations are not functions
- Undelimited continuations are often mis-represented as functions, e.g., in Scheme. We explain the distinction and describe the proper undelimited continuation monad, which differs from the one in Haskell's monad transformer libraries.
- TLCA List of Open Problems
- Time hierarchy theorem - Wikipedia, the free encyclopedia
- Marelle
- Operating-system-level virtualization - Wikipedia, the free encyclopedia
- Boehm-Berarducci Encoding
- Explaining the Boehm-Berarducci isomorphism between strictly-positive algebraic data types and a class of polymorphic System F terms, and illustrating it on a simple example
- functional programming - What is the difference between the Mogensen-Scott and the Boehm-Berarducci encoding for ADTs on the Lambda Calculus? - Computer Science Stack Exchange
- http://winterkoninkje.dreamwidth.org/101420.html
- ChurchScottDataTypes.pdf
- [0812.4852] Formalizing common sense for scalable inconsistency-robust information integration using Direct Logic(TM) reasoning and the Actor Model
- MobiGuide - Inconsistency Robustness’14 Symposium
- DSS Clinical Guidelines Decision Support Medical Mobile Guidance MobiGuide Health Personal Monitoring
- 13th International Symposium FLOPS: March 2016, Kochi, Japan
- FLOPS Symposium web page and CFP
- Probably approximately correct learning - Wikipedia, the free encyclopedia
- IEEE Xplore Book Home Page - An Introduction to Computational Learning Theory
- Probably Approximately Correct: Natures Algorithms for Learning and Prospering in a Complex World: Leslie Valiant: 9780465032716: Amazon.com: Books
- Probably Approximately Correct: Natures Algorithms for Learning and Prospering in a Complex World [Leslie Valiant] on Amazon.com. *FREE* shipping on qualifying offers. <div><B>From a leading computer scientist, a unifying theory that will revolutionize our understanding of how life evolves and learns.</B><BR><BR>How does life prosper in a complex and erratic world? While we know that nature follows patterns—such as the law of gravity—our everyday lives are beyond what known science can predict. We nevertheless muddle through even in the absence of theories of how to act. But how do we do it?<BR><BR>In <I>Probably Approximately Correct</I>
- The Golden Ticket: P, NP, and the Search for the Impossible: Lance Fortnow: 9780691156491: Amazon.com: Books
- The Golden Ticket: P, NP, and the Search for the Impossible [Lance Fortnow] on Amazon.com. *FREE* shipping on qualifying offers. The P-NP problem is the most important open problem in computer science, if not all of mathematics. The Golden Ticket</i> provides a nontechnical introduction to P-NP
- Visions of Infinity: The Great Mathematical Problems: Ian Stewart: 9780465022403: Amazon.com: Books
- Visions of Infinity: The Great Mathematical Problems [Ian Stewart] on Amazon.com. *FREE* shipping on qualifying offers. <div>It is one of the wonders of mathematics that, for every problem mathematicians solve, another awaits to perplex and galvanize them. Some of these problems are new
- Introduction
- dscal.pdf
- dscal-talk.pdf
- dscal-tr.pdf
- Fundamentals of Deep Learning - O'Reilly Media
- With the reinvigoration of neural networks in the 2000s, deep learning has become an extremely active area of research that is paving the way for modern machine learning. This book uses exposition and examples to help you understand major concepts...
- icfp13.dvi - icfp13.pdf
- logpolpro.pdf
- Guillaume Claret
- Homepage
- gr2.pdf
- lecun-20150610-cvpr-keynote.pdf - Google Drive
- Paraconsistent logic - Wikipedia, the free encyclopedia
- The Weird World of Bi-Directional Programming - lenses-etapsslides.pdf
- March | 2011 | Existential Type
- 7 posts published by Robert Harper during March 2011
- ML4PG
- Machine learning and automated theorem proving - UCAM-CL-TR-792.pdf
- PRL Cross-links to Artificial Intelligence
- implementing computational mathematics and providing logic-based tools that help automate programming
- FDL-apr14-berkeley.ppt - FDL-apr14-berkeley.pdf
- Formal program optimization in nuprl using computational equivalence and partial types
- 02cucs-enhancing-proof-assistants-slides.pdf
- IEEE Xplore Abstract - Using machine learning to synthesize search programs
- IEEE Xplore. Delivering full text access to the world's highest quality technical literature in engineering and technology.
- Vincent Rahli's homepage
- Vincent Rahli's homepage
- World wide associates of the PRL Project
- implementing computational mathematics and providing logic-based tools that help automate programming
- MetaPRL Proof Assistant and Logical Programming Environment
- nitpick.pdf
- tutorial.pdf
- ACL2 Version 7.1
- Tim Sheard's home page
- Logical framework - Wikipedia, the free encyclopedia
- Freek Wiedijk
- Mathematical Components
- logical_framework-CentreForInternationalDevelopmentAndTraining.pdf
- Triumph-of-Types-Extended.pdf
- Dana Scott - Wikipedia, the free encyclopedia
- Lambda Tamer
- Arthur Charguéraud's home page
- Arthur Charguéraud's home page
- Implementing a Coq tactic in OCaml - Stack Overflow
- Marisa-san : touhou
- reddit: the front page of the internet
- LLWiki
- A Neighborhood of Infinity: The Mother of all Monads
- Tutorial.pdf
- Erasable coercions: a unified approach to type systems
- The classical extraction module for Coq
- () - 1101.4364v2.pdf
-
- OPTIMAL SEARCH, UNIVERSAL SEARCH, LEVIN SEARCH, HUTTER SEARCH, OOPS
- Levin’s Great Discoveries | Gödel's Lost Letter and P=NP
- Levin's discovery of universal problems and more Leonid Levin is one of the creators of the question of computer science---the $latex {\mathsf{P}}&fg=000000$ versus $latex {\mathsf{NP}}&fg=000000$ question. He published this work back in 1972--1973, Today I want to discuss Levin's original paper. The reason I thought it would be interesting to look at his original paper…
- On the Necessity of Enumerating All Programs | in theory
- In a tutorial on average-case complexity that I gave at FOCS 2008, I mentioned four of my favorite open questions in the theory. I have some progress to report on one of the questions (#3 in this post), and on two related problems. The question is whether a certain exponential loss is necessary in Levin's…
- pfastprg.pdf
- A Sequent Calculus for Type Theory - Springer
- tomprince/rippling
- Sean Wilson's rippling plugin.
- AMachine-checkedProofoftheAverage-caseComplexityofQuicksortinCoq - types2008.pdf
- SMA* - Wikipedia, the free encyclopedia
- Computation with classical sequents | AMiner - Open Science Platform
- A sequent calculus for type theory | AMiner - Open Science Platform
- Pattern Matching as Cut Elimination | AMiner - Open Science Platform
- A sequent calculus for subtyping polymorphic types | AMiner - Open Science Platform
- Linear Logic As A Framework For Specifying Sequent Calculus | AMiner - Open Science Platform
- A formal framework for specifying sequent calculus proof systems | AMiner - Open Science Platform
- The duality of computation | AMiner - Open Science Platform
- On the Specification of Sequent Systems | AMiner - Open Science Platform
- Ambiguity and reasoning | AMiner - Open Science Platform
- Generic Universe Types | AMiner - Open Science Platform
- A Sequent Calculus for Skeptical Default Logic | AMiner - Open Science Platform
- SML '97 Types and Type Checking
- Univalent Foundations: “No Comment.” | Mathematics without Apologies, by Michael Harris
- "No Comment" was Jacob Lurie's reaction when the panel of Breakthrough Prize laureates was asked, at last November's Breakthrough Prize Symposium at Stanford, what they thought of the "prospects for the Univalent Foundations program and whether that is a contender for changing" foundations of mathematics. The other panelists had deferred to Lurie, in some amusement;…
- A Local System for Classical Logic | AMiner - Open Science Platform
- Automatic program generation using sequent calculus | AMiner - Open Science Platform
- Cirquent Calculus Deepened | AMiner - Open Science Platform
- Introduction to Cirquent Calculus and Abstract Resource Semantics* This material is based upon work supported by the National Science Foundation under Grant No. 0208816, and 2005 Summer Research Grant from Villanova University. | AMiner - Open Science Platform
- A conditional constructive logic for access control and its sequent calculus | AMiner - Open Science Platform
- Automated reasoning in quantified modal and temporal logics | AMiner - Open Science Platform
- Sequent calculus - Wikipedia, the free encyclopedia
- Sequent Calculus -- from Wolfram MathWorld
- Proof calculus - Wikipedia, the free encyclopedia
- Structural proof theory - Wikipedia, the free encyclopedia
- Begriffsschrift - Wikipedia, the free encyclopedia
- Deep inference - Wikipedia, the free encyclopedia
- Propositional proof system - Wikipedia, the free encyclopedia
- Proof theory - Wikipedia, the free encyclopedia
- Building and using pluggable type-checkers | AMiner - Open Science Platform
- JavaCOP: Declarative pluggable types for java | AMiner - Open Science Platform
- A framework for implementing pluggable type systems | AMiner - Open Science Platform
- Practical, pluggable types | AMiner - Open Science Platform
- Generalized typestate checking using set interfaces and pluggable analyses | AMiner - Open Science Platform
- Building and using pluggable type-checkers | AMiner - Open Science Platform
- On the revival of dynamic languages | AMiner - Open Science Platform
- This FTP site
- Main index of okmij.org
- Patent WO2014105866A1 - System and method for addressing overfitting in a neural network - Google Patents
- A system for training a neural network. A switch is linked to feature detectors in at least some of the layers of the neural network. For each training case, the switch randomly selectively disables each of the feature detectors in accordance with a preconfigured probability. The weights from each training case are then normalized for applying the neural network to test data.
- The Problems of Traditional Math Notation
- Teaching Math More Effectively, Through Calculational Proofs on JSTOR
- JSTOR is a digital library of academic journals, books, and primary sources.
- How Computing Science created a new mathematical style
- issue221.pdf
- Voevodsky’s Mathematical Revolution - Guest Blog - Scientific American Blog Network
- On last Thursday at the Heidelberg Laureate Forum, Vladimir Voevodsky gave perhaps the most revolutionary scientific talk I’ve ever heard. I doubt if it generated much buzz among the young scientists in advance, though, because it had the inscrutable title “Univalent Foundations of Mathematics,” and the abstract contained sentences like this one: “Set-theoretic approach to foundations [...]
- Automated complexity analysis of Nuprl extracted programs
- Lightweight structural summarization as an aid to software evolution
- gatoatigrado / sketch-frontend / wiki / Tutorial — Bitbucket
- http://www.cs.cmu.edu/~noam/research/dtp08.agda
- polpol.pdf
- mfps08.pdf
- ptech.dvi - ptech.pdf
- Great Works in Programming Languages
- viewcontent.cgi
- PII: 0022-0000(78)90014-4 - milner-polymorphism.pdf
- Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- sos_jlap.pdf
- PII: 0304-3975(77)90044-5 - LCF.pdf
- tal-toplas.dvi - tal-toplas.pdf
- lics89.pdf
- bohm-jac.pdf
- thpl_24_1.pdf - lambda.pdf
- Jeremy Siek: Interpretations of the Gradually-Typed Lambda Calculus, Part 1
- Publications
- cacm13.pdf
- toplas-witness.pdf
- main.dvi - pldi13.pdf
- sas13.pdf
- paper.dvi - FLProject.pdf
- inf.dvi - popl91.pdf
- paper.dvi - dls-pldi02.pdf
- Gagallium : Formally verifying the complexity of OCaml programs with CFML -- part 1
- Statistical Proof-Patterns in Coq/SSReflect (PDF Download Available)
- Official Full-Text Publication: Statistical Proof-Patterns in Coq/SSReflect on ResearchGate, the professional network for scientists.
- Formalization of Shannon’s Theorems in SSReflect-Coq - Springer
- Cohen.pdf
- ismb017.dvi - S74.full.pdf
- logict: A backtracking logic-programming monad. | Hackage
- LogicT.pdf
- Tuples And Lists In Lambda Calculus
- How to implement tuples and lists in lambda calculus
- Polymorphic effect systems
- Self-Adjusting Computation - Umut Acar - Carnegie Mellon University
- This is Umut Acar's research web page at the Carnegie Mellon University Computer Science Department (CMU, CSD, SCS) in Pittsburgh, PA, USA. It contains information about my ongoing research, research group, and our research activities.
The page contains links to our papers (publications) as well as to our collaborators, and co-authors.
Keywords: incremental computation, self-adjusting computation, dynamic algorithms, incremental algorithms, computational geometry, convex hulls, kinetic data structures, kinetic algorithms
parallel computation, parallelism, scheduling, granularity control, fine-grained parallelism, threading, multithreading, multithreaded computation.
programming languages, cost semantics, semantics, type systems,
algorithms, dynamic algorithms, incremental algorithms, dynamic data structures, kinetic algorithms, kinetic data structure, analysis, meshing, convex hulls.
big data, mapreduce, incremental mapreduce,
- Umut Acar - Carnegie Mellon University
- This is Umut Acar's research web page at the Carnegie Mellon University Computer Science Department (CMU, CSD, SCS) in Pittsburgh, PA, USA. It contains information about my ongoing research, research group, and our research activities.
The page contains links to our papers (publications) as well as to our collaborators, and co-authors.
Keywords: incremental computation, self-adjusting computation, dynamic algorithms, incremental algorithms, computational geometry, convex hulls, kinetic data structures, kinetic algorithms
parallel computation, parallelism, scheduling, granularity control, fine-grained parallelism, threading, multithreading, multithreaded computation.
programming languages, cost semantics, semantics, type systems,
algorithms, dynamic algorithms, incremental algorithms, dynamic data structures, kinetic algorithms, kinetic data structure, analysis, meshing, convex hulls.
big data, mapreduce, incremental mapreduce,
- Papers
- secp.pdf
- 15-317 Constructive Logic
- Constructive Logic
- Practical Foundations of Mathematics
- coq-club - The Coq mailing list - compose_mail
- Game semantics - Wikipedia, the free encyclopedia
- BER MetaOCaml
- Introduction to BER MetaOCaml: how to use and how to install, the current status and future development
- Constraint logic programming in the sequent calculus - Springer
- CiteSeerX — Citation Query Applications of game semantics: From software analysis to hardware synthesis
- CiteSeerX - Scientific documents that cite the following paper: Applications of game semantics: From software analysis to hardware synthesis
- Homepage Henk Barendregt
- http://www.cs.ru.nl/barendregt60/essays/
- Pcoq : A java-based user-interface for Coq
- TPHOLs'99
- LFM'02
- LFM'02 Workshop Home Page
- FLoC '02 - front page
- MKM 2003 - Home Page
- Second International Conference on Mathematical Knowledge Management
- MKM 2003 - Home Page
- Second International Conference on Mathematical Knowledge Management
- Papers
- PPDP 2003
- Dale Miller - Home page
- Home page for Dale Miller
- PPDP'08
- WFLP 2003
- CSL/KGC'03 - Welcome and News
- RDP 2003 - Hotel Information
- TACAS 2003 Conference Program
- RTA 2004
- RDP 2004
- Johan van Benthem (logician) - Wikipedia, the free encyclopedia
- Interpolation and Definability in Guarded Fragments - Springer
- On the Restraining Power of Guards on JSTOR
- JSTOR is a digital library of academic journals, books, and primary sources.
- Loosely Guarded Fragment of First-Order Logic Has the Finite Model Property on JSTOR
- JSTOR is a digital library of academic journals, books, and primary sources.
- index.html
- Why3
- http://cswww.essex.ac.uk/staff/henson/sssl/lfsl04.doc
- LFM'04
- PPDP 2005: Call for Papers
- ACM SIG Proceedings Templates — Association for Computing Machinery
- User Interfaces for Theorem Provers, UITP 2005
- ICCL Summer School 2004
- The Mercury Project: Home
- The Types Project
- DBLP: Thierry Coquand
- The Mathematics Genealogy Project - Thierry Coquand
- Laurent Thery
- View Laurent Thery (Laurent Théry)'s professional profile. Publications: 36 | Citations: 427 Field Rating: 12. Fields of study: Algorithms & Theory, Hardware & Architecture, Artificial Intelligence
- TPHOLs 2007
- References
- WING 2007 - Workshop on Invariant Generation
- Computer verification of Wiles' proof of Fermat's Last Theorem
- Calculemus 2007
- http://coqprime.gforge.inria.fr/
- Journal of Formalized Reasoning
- The journal is meant to become the natural
- coq-club - The Coq mailing list - arc
- mitch-plotkin-88.pdf
- The POPLmark Challenge
- POPLmark challenge - Wikipedia, the free encyclopedia
- Blueish 2 column
- MLPA-09 - PLSwiki
- TAP: Tests and Proofs
- CiteSeerX — Citation Query Coq library: ATBR, Algebraic tools for working with binary relations. http://sardes.inrialpes.fr/~braibant/atbr
- CiteSeerX - Scientific documents that cite the following paper: Coq library: ATBR, Algebraic tools for working with binary relations. http://sardes.inrialpes.fr/~braibant/atbr
- An Efficient Coq Tactic for Deciding Kleene Algebras - Springer
- Marelle Bibliography
- Fixed point semantics and partial recursion in Coq
- We propose to use the Knaster-Tarski least fixed point theorem as a basis to define recursive functions in the Calculus of Inductive Constructions. This widens the class of functions that can be modelled in type-theory based theorem proving tools to potentially non-terminating functions. This is only possible if we extend the logical framework by adding some axioms of classical logic. We claim that the extended framework makes it possible to reason about terminating or non-terminating computations and we show that extraction can also be extended to handle the new functions.
- 05021.MahboubiAssia.Paper.276.pdf
- sieve.pdf
- slides.pdf
- WMM 2009 Home Page
- A key to massively collaborative math is a good interface for writing proofs - Théo Zimmermann
- Mostly a place to share ideas and thoughts.
- Getting thousands to millions of people working on a single mathematical proof - Théo Zimmermann
- Mostly a place to share ideas and thoughts.
- IsaPlanner : A Proof Planner for Isabelle
- Homepage for Isabelle/IsaPlanner: proof planning and inductive theorem proving for the proof assistant Isabelle.
- zfc.dvi - tacs97.pdf
- CoLoR: a Coq Library on Rewriting theory and termination
- icml2013-algebraic-classifiers.pdf
- download
- thesis.dvi - bhat_sooraj_b_201305_phd.pdf
- 00b7d527b5a3471c2b000000.pdf
- Innovations in computational type theory using Nuprl
- naive.pdf
- ReflectingOpenEnded.pdf
- A technique for doing lazy evaluation in logic
- Workshop: Trusted Extensions of Interactive Theorem Provers
- pilki/cases
- cases - A bit more than the (S*)Case tactics in Coq
- Adam Chlipala - Research Interests & Projects
- Bedrock, a Coq library for verified low-level programming
- Fiat
- Mtac: A Monad for Typed Tactic Programming in Coq - ResearchGate
- Publication » Mtac: A Monad for Typed Tactic Programming in Coq.
- fiat-popl2015.pdf
- Free structure - HaskellWiki
- Monads as computation - HaskellWiki
- Monad - HaskellWiki
- TPHOLS09.pdf
- Coq blog - Guillaume Claret
- Elgot Monads - ResearchGate
- Publication » Elgot Monads.
- CoLoR.Util.Polynom.Polynom
- Programming Languages for Mechanized Mathematics Systems
- braibant/coq-tutorial-ml-tactics
- coq-tutorial-ml-tactics - A tutorial on how to write OCaml tactics for the Coq proof assistant
- tomprince/abstract_hint
- abstract_hint - Tactic to add proof of goal as a hint.
- infcomp99.pdf
- CiteSeerX — ECC, an Extended Calculus of Constructions
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): We present a higher-order calculus ECC which can be seen as an extension of the calculus of constructions [CH88] by adding strong sum types and a fully cumulative type hierarchy. ECC turns out to be rather expressive so that mathematical theories can be abstractly described and abstract mathematics may be adequately formalized. It is shown that ECC is strongly normalizing and has other nice proof-theoretic properties. An !\GammaSet (realizability) model is described to show how the essential properties of the calculus can be captured set-theoretically.
- Works in Coq
- The Inconsistency of Arithmetic | The n-Category Café
- Mechanical Theorem Proving in Tarski's geometry.
- This paper describes the mechanization of the proofs of the first height chapters of Schwabäuser, Szmielew and Tarski's book: Metamathematische Methoden in der Geometrie. The goal of this development is to provide foundations for other formalizations of geometry and implementations of decision procedures. We compare the mechanized proofs with the informal proofs. We also compare this piece of formalization with the previous work done about Hilbert's Gründlagen der Geometrie. We analyze the differences between the two axiom systems from the formalization point of view.
- CICM 2012 - Conferences on Intelligent Computer Mathematics
- Conferences on Intelligent Computer Mathematics 2010
- icfp2013-mtac.pdf
- Fast type reconstruction for dynamically typed programming languages. (PDF Download Available)
- Official Full-Text Publication: Fast type reconstruction for dynamically typed programming languages. on ResearchGate, the professional network for scientists.
- ATX 2012
- universe.pdf
- Fundamental theorem of algebra - Wikipedia, the free encyclopedia
- Jordan curve theorem - Wikipedia, the free encyclopedia
- CiteSeerX — MODULES OVER MONADS, MONADIC SYNTAX AND THE CATEGORY OF UNTYPED LAMBDA-CALCULI
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract. We define a notion of module over a monad and use it to propose a new definition (or semantics) for abstract syntax (with binding constructions). Using our notion of module, we build a category of exponential monads, which can be understood as the category of lambda-calculi, and prove that it has an initial object (the pure untyped lambda-calculus). Our definitions and results are formalized in the proof assistant Coq. 1.
- Linear logic, monads, and the lambda calculus (DRAFT) - ResearchGate
- Publication » Linear logic, monads, and the lambda calculus (DRAFT).
- cse | ForMath / ForMath: Formalisation of Mathematics
- ct.category theory - Where is there a treatment of "exponential monads"? - MathOverflow
- Type Theory
- fol.pdf
- () - cpp11.pdf
- CiteSeerX — Formalizing and Implementing a Reflexive Tactic for Automated Deduction in Coq
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): présentée pour obtenir le grade de docteur en sciences DE L’UNIVERSITÉ PARIS XI
- thesis.pdf
- Matthias Puech - Home Page
- coq-ext-lib/coq-ext-lib
- coq-ext-lib - A library of Coq definitions, theorems, and tactics.
- Extensible Proof Engineering in Intensional Type Theory | gregory malecha
- Write an awesome description for your new site here. You can edit this line in _config.yml. It will appear in your document head meta (for Google search results) and in your feed.xml site description.
- Reflecting Modular Automation | gregory malecha
- Write an awesome description for your new site here. You can edit this line in _config.yml. It will appear in your document head meta (for Google search results) and in your feed.xml site description.
- Directly reflective meta-programming.
- Directly reflective meta-programming. on ResearchGate, the professional network for scientists.
- F*: A Higher-Order Effectful Language Designed for Program Verification
- gmalecha/mirror-core
- mirror-core - A framework for extensible, reflective decision procedures.
- Automated Proof Construction in Type Theory Using Resolution - Springer
- Coq Modulo Theory - Springer
- Combining Coq and Gappa for Certifying Floating-Point Programs.
- Combining Coq and Gappa for Certifying Floating-Point Programs. on ResearchGate, the professional network for scientists.
- lescuyer-conchon-tphols08.pdf
- () - VA2_LESCUYER_STEPHANE_04012011.pdf
- Certified Programs and Proofs - First International | Jean-Pierre Jouannaud | Springer
- This book constitutes the referred proceedings of the First International Conference on Certified Programs and Proofs, CPP 2011, held in Kenting, Taiwan,
- Well-Typed - The Haskell Consultants: Parametricity Tutorial (Part 1)
- free.dvi - free.pdf
- IEEE Xplore Abstract - On non-computable functions
- IEEE Xplore. Delivering full text access to the world's highest quality technical literature in engineering and technology.
- portsmouth.pdf
- TACS94.pdf
- ISO/IEC JTC1/SC22/WG21 - The C++ Standards Committee - ISOCPP
- 2002-1869.pdf
- Equivalence Relations and Quotient Types
- Initial algebra - Wikipedia, the free encyclopedia
- Evolutionary multimodal optimization - Wikipedia, the free encyclopedia
- Topological space - Wikipedia, the free encyclopedia
- Continuation
- Canonical Structures for the working Coq user
- This paper provides a gentle introduction to the art of programming type inference with the mechanism of Canonical Structures. Programmable type inference has been one of the key ingredients for the successful formalization of the Odd Order Theorem using the Coq proof assistant. The paper concludes comparing the language of Canonical Structures to the one of Type Classes and Unification Hints.
- canonical-structures-currying
- asking the right questions - 必应
- mean gene book - 必应
- A Theory of Positive Integers in Formal Logic - 必应
- Highe order categorical logic Lambek P.J.Scott - 必应
- Knuth–Bendix completion algorithm - Wikipedia, the free encyclopedia
- lambda models programming wikipedia - 必应
- Logic Program Synthesis and Transformation Meta-programming in Logic
- Logic Program Synthesis and Transformation Meta-programming in Logic on ResearchGate, the professional network for scientists.
- untitled - 0403033.pdf
- New paradigms for software development
- Authors: W. W. Agresti. Citations: 55
- Frege’s Begriffsschrift as a lingua characteristica - ResearchGate
- Publication » Frege’s Begriffsschrift as a lingua characteristica.
- http://www.amazon.com/Measuring-Reasoning-Numerical-Inference-Sciences/dp/1107024153
- The Intel 6th Gen Skylake Review: Core i7-6700K and i5-6600K Tested
- eXtreme Power Supply Calculator
- eXtreme Power Supply Calculator - Calculate PC power consumption. Select computer parts and our online PSU calculator will provide the required wattage for your PC.
- Integrating coercion with subtyping and multiple dispatch
- http://link.springer.com/chapter/10.1007/3-540-52531-9_124?no-access=true
- paper.pdf
- From LCF to HOL
- 东方小镇 - Powered by phpwind
- 东方小镇,东方同人堂,动漫,东方,同人,创作,音乐,游戏,漫画,汉化
- Scott domain - Wikipedia, the free encyclopedia
- Game complexity - Wikipedia, the free encyclopedia
- Creative and productive sets - Wikipedia, the free encyclopedia
- Chapter 2 Extensions of Gallina
- Chapter 27 Generalized rewriting
- (2) Is group theory used in AI? - Quora
- Amazon.com: Modern Classical Homotopy Theory (Graduate Studies in Mathematics) (9780821852866): Jeffrey Strom: Books
- Amazon.com: Modern Classical Homotopy Theory (Graduate Studies in Mathematics) (9780821852866): Jeffrey Strom: Books
- Bigraph - Wikipedia, the free encyclopedia
- Jeff Paris - Wikipedia, the free encyclopedia
- NZXT Kraken G10 Review: Liquid Cooling for Your GPU
- An Overview Of The Marpa Parser | Lukas Atkinson
- Understanding Mentor Partnerships | Mentor Power for Success
- Connecting you to the future
- UW Hackers | Facebook
- UW Hackers. 258 likes · 4 talking about this. UW Hackers (formerly known as Sudo Soldiers) exists to cultivate a community of makers who express their...
- Undergraduate Research Program
- University of Washington
- FrozenCPU.com | 1.877.243.8266 | World's Largest Selection of PC Modification Supplies
- The worlds largest selection of PC modification supplies. Offers computer pc cases, pc and computer cooling systems, cpu coolers, power supplies and custom pc mods for best computer performance and cooling.
- Radiator Review Round Up 2015 - ExtremeRigs.net
- 360 Radiator Review - hardware labs, koolance, ek, xspc, aquacomputer, watercool, water cooling, black ice, liquid cooling, phobya, alphacool, coolgate
- Fans!!!! The most complete and comprehensive array of tests and benchmarks
- LNA = Low Noise AdaptorULNA = Ultra Low Noise Adaptor [[SPOILER]] [[SPOILER]] [[SPOILER]] [[SPOILER]] [[SPOILER]] [[SPOILER]] [[SPOILER]]
- Foundations of Databases
- 5-datalog-eval.dvi - 5-datalog-eval.pdf
- The Dip
- thesis.pdf
- Probabilistic logic - Wikipedia, the free encyclopedia
- Probabilistic logic network - Wikipedia, the free encyclopedia
- LOLITA - Wikipedia, the free encyclopedia
- p009-bracha.fm - mirrors.pdf
- CiteSeerX — Homoiconicity, Lazyness and First-Class Macros
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Homoiconicity and laziness have been studied in isolation and are gen-erally well understood properties of programming languages. Both prop-erties have been shown to support unique abstractions that are challenging to implement in other language types. However little research has been done into whether or not further unique abstractions become available in languages that are both lazy and homoiconic. One natural abstraction in such languages turns out to be closely related to the much derided F-expressions used in old dialects of lisp, but are they as bad as they are
- RandomAccessADT_AMAST00.pdf
- Modeling "The Hardest Logic Puzzle Ever" in Haskell - Utku Demir
- Petke_2014_EuroGP-1.pdf - Petke-Paper.pdf
- D:\IEEE\Jan-2014\3-1-2014\mail-corr\tevc-vandenherik-2285111\tevc-vandenherik-2285111-proof.dvi - David-Paper.pdf
- pap312-melo.dvi - DeMelo-Paper.pdf
- Thinking In Numbers: On Life, Love, Meaning, and Math by Daniel Tammet — Reviews, Discussion, Bookclubs, Lists
- Thinking In Numbers has 738 ratings and 135 reviews. Ben said: I can’t resist picking up mathy books when I’m in a bookstore. As a mathematician, I love ...
- Genetic Symbiosis Algorithm
- Genetic Symbiosis Algorithm on ResearchGate, the professional network for scientists.
- CPwTP-icfp05.pdf
- CiteSeerX — Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): We describe a sequent calculus, based on work of Herbelin, of which the cut-free derivations are in 1-1 correspondence with the normal natural deduction proofs of intuitionistic logic. We present a simple proof of Herbelin's strong cutelimination theorem for the calculus, using the recursive path ordering theorem of Dershowitz.
- CiteSeerX — Bidirectional Natural Deduction
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): The goal of this paper is to present a theorem prover able to perform both forward and backward reasoning supported by a well defined formal system. This system for bidirectional reasoning has been proved equivalent to Gentzen's classical system of propositional natural deduction. This paper, primarily aimed at developing a deeper theoretical understanding of bidirectional reasoning, provides basic concepts to be incorporated into an innovative theorem prover to support interactive proofs construction in general domains. 1
- Proofs and Types
- mscs00.pdf
- CiteSeerX — LF in LF: Mechanizing the Metatheory of LF in Twelf
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): We present a mechanized proof of the metatheory of LF, i.e. the decidability of typechecking and the existence and uniqueness of canonical forms. We use a syntactic approach in which we define a translation from LF to its canonical forms presentation (in which only beta-short, eta-long terms are well-formed) and prove soundness and completeness of the translation, establishing that definitional equivalence in LF corresponds to syntactic equivalence in canonical forms. Much recent work is based on the system of canonical forms and hereditary substitution presented herein; our proof also serves to reconcile that presentation with the traditional version based on definitional equivalence.
- CiteSeerX — Bidirectional Reasoning
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): The goal of this paper is to present a formal system FB for bidirectional reasoning which integrates forward and backward deduction. FB is proved equivalent to Gentzen's classical system of propositional natural deduction. FB is the logic of a theorem prover which supports interactive proof construction in general domains. 1
- Intercalation calculus for intuitionistic propositional logic - viewcontent.cgi
- "Intercalation Calculus for Intuitionistic Propositional Logic" by Saverio Cittadini
- Saverio Cittadini. Intercalation Calculus for Intuitionistic Propositional Logic.
- ch3-seqcalc.pdf
- Benzmuller1.pdf
- Strategic Proof Tutoring in Logic
- Strategic Proof Tutoring in Logic - Free download as PDF File (.pdf), Text file (.txt) or read online for free. In the mostly online course Logic and Proofs, students learn to construct natural deduction proofs in the Carnegie Proof Lab, a computer-based proof construction environment. When given challenging problems, students have difficulty figuring out how the premises connect with the conclusion. Through use of a modification of the intercalation calculus, a strategy is provided to students on choosing which inference rules to apply in various circumstances. The strategy is also implemented in AProS, an automated theorem prover. In this thesis I describe how the Carnegie Proof Lab has been extended to provide three different modes of dynamic strategic proof tutoring, using AProS to help generate hints. The Explanation Tutor explains how tactics apply to partial proofs, the Walkthrough Tutor guides students through strategically constructed proofs, and the Completion Tutor provides on-demand strategic hints. When properly used, they should provide students with support in learning how to construct proofs in a strategic fashion.
See also:
https://dperkins.org/
https://dperkins.org/thesis/
https://identi.ca/dper
- Strategic Proof Tutoring in Logic : Douglas Perkins : Free Download & Streaming : Internet Archive
- In the mostly online course Logic and Proofs, students learn to construct natural deduction proofs in the Carnegie Proof Lab, a computer-based proof...
- Lab for Symbolic and Educational Computing
- jzm026 359..368 - AProS-Strategic-Thinking-Comp-Logic.pdf
- Extensibility for the Masses - Springer
- Journal of Functional Programming - Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages - Cambridge Journals Online
- We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, generalized algebraic data types, or postprocessing to eliminate tags. The statically type-preserving interpretations include an evaluator, a compiler (or staged evaluator), a partial evaluator, and call-by-name and call-by-value continuation-passing style (CPS) transformers. Our principal technique is to encode de Bruijn or higher-order abstract syntax using combinator functions rather than data constructors. In other words, we represent object terms not in an initial algebra but using the coalgebraic structure of the λ-calculus. Our representation also simulates inductive maps from types to types, which are required for typed partial evaluation and CPS transformations. Our encoding of an object term abstracts uniformly over the family of ways to interpret it, yet statically assures that the interpreters never get stuck. This family of interpreters thus demonstrates again that it is useful to abstract over higher-kinded types.
- 05-jal-final.pdf
- Linking Game-Theoretical Approaches with Constructive Type Theory: Dialogical Strategies, CTT Demonstrations and the Axiom of Choice (Paperback) | The Book Table
- JonPRL: Proof Refinement Logic
- JS ≫ Research Blog
- PSE Examples and Research
- LPE - Workshop on Logic Programming Environments
- Workshop on Logic Programming Environments. Publications: 87 | Citations: 431. Fields of study: Programming Languages
- unguessable.pdf
- Formal.Foundations.of.Computer.Security.Security.pdf
- Model theory - Wikipedia, the free encyclopedia
- Rank-N types - HaskellWiki
- C&C - A Basic Tutorial on JonPRL
- GotW.ca Home Page
- John C. Reynolds - Wikipedia, the free encyclopedia
- EssenceOfReynolds.pdf
- Production system (computer science) - Wikipedia, the free encyclopedia
- The Scarlets Awaken - YouTube
- --Warning: Video contains partial nudity.-- An animation I have been working on for the past few weeks. It started out as a test animation of Remilia; but I ...
- exists_imp.pdf
- Principals in programming languages
- Test-driven synthesis
- tal_scale.pdf
- a1972-dijkstra.pdf
- acar.pdf
- HoareLogicStateMonad.pdf
- eastep-smart-data-structures-icac11.pdf
- posts
- {{description}}
- Writings
- {{description}}
- Samson Abramsky - Wikipedia, the free encyclopedia
- verify-TR294.pdf
- P - aditya-presentation.pdf
- Machine Learning for Automated Synthesis of Complex Software - machine-learning-for-automated-synthesis-of-complex-software-2165- 7866.1000e113.pdf
- - PSI000008.pdf
- Title - RuleExtractionTaylor.pdf
- Formal Verification and Planning: An Evaluation - viewcontent.cgi
- http://www.cs.ust.hk/~flin/papers.html
- A Formalization of Programs in First-Order Logic with a Discrete Linear Order - kr2014-program.pdf
- () - ReflectionProofs.pdf
- leanCoP: Lean Connection-Based Theorem Proving
- 东方同人音乐博物馆【红】【387P】(20)_音乐选集_音乐_bilibili_哔哩哔哩弹幕视频网
- 自制 封面画师推特id遗失
- Scheme Reports
- 东方同人音乐博物馆【红】【387P】(23)_音乐选集_音乐_bilibili_哔哩哔哩弹幕视频网
- 自制 封面画师推特id遗失
- Peter Naur - Wikipedia, the free encyclopedia
- ITP 2015 Accepted Papers
- 东方同人音乐博物馆【红】【387P】(25)_音乐选集_音乐_bilibili_哔哩哔哩弹幕视频网
- 自制 封面画师推特id遗失
- ITT.pdf
- dstypes.pdf
- theses_published_uppsala.pdf
- Constructive Validity | Homotopy Type Theory
- (This is intended to complement Mike Shulman's nCat Cafe posting HoTT, II.) The Propositions-as-Types conception of Martin-Löf type theory leads to a system of logic that is different from both classical and intuitionistic logic with respect to the statements that hold in the fragment of logical language that these three share, namely the quantifiers $latex \Pi$…
- TTH.pdf
- ref-immutability-oopsla2004.pdf
- plpv09.pdf
- ho-contracts-techreport.pdf
- toplas14-typestate.pdf
- Higher-Order Symbolic Execution via Contracts - tobin-hochstadt-vanhorn-oopsla12.pdf
- Contract.pdf
- icfp11.pdf
- 1508.06576v1.pdf
- AI-based query compilers - Google 搜索
- Amazon.com: Inconsistency Robustness (9781848901599): Carl Hewitt, John Woods: Books
- Amazon.com: Inconsistency Robustness (9781848901599): Carl Hewitt, John Woods: Books
- Extensible programming - Wikipedia, the free encyclopedia
- Intermediate logic - Wikipedia, the free encyclopedia
- ART.pdf
- ppdp10-synthesis.pdf
- Webinar - Open Sourcing Your Career with GitHub | SkillsCast | 26th August 2015
- eSynergy Solutions community cast. Cynthia Rich: Join us for eSynergy’s upcoming webinar ‘Open Sourcing Your Career’ with GitHub. We know open source is fun,...
- Applicative bidirectional programming with lenses
- Dynamic Programming in Haskell | The Haskell Sequence
- Adventures with types | SkillsCast | 15th March 2013
- Functional Programming eXchange 2013 conference cast. Simon Peyton Jones: Static type systems are the world’s most widely applied formal method, in daily use...
- The Comonad.Reader
- http://www.cs.cmu.edu/~reinf/www/talks-1999/99-01-19.schmid.txt
- cav13a.pdf
- ppdp10-synthesis.pdf
- Point-Free, Set-Free Concrete Linear Algebra - Springer
- paper.dvi - mlc00c.pdf
- mlj02.pdf
- Version space learning - Wikipedia, the free encyclopedia
- Formal concept analysis - Wikipedia, the free encyclopedia
- Belief propagation - Wikipedia, the free encyclopedia
- Deductive Synthesis Of The Unification Algorithm | SRI International
- The deductive approach is a formal program construction method in which the derivation of a program from a given specification is regarded as a theorem-proving task
- Program Synthesis, Explained — James Bornholt — University of Washington
- download
- arXiv:1505.05868v1 [cs.PL] 21 May 2015 - 1505.05868.pdf
- The ADATE System
- download
- Isabelle
- runtime2.eps - synth-icse10.pdf
- logic - Learning Automated Theorem Proving - Computer Science Stack Exchange
- TPTP
- runtime2.eps - icse10_synthesis.pdf
- Interactive Proof Critics - Springer
- MO3DD6367C1E62D78.pdf - J2.pdf
- Creating user interfaces using programming by example, visual programming, and constraints
- 01-AspinallLueth.pdf
- 04-Giese.pdf
- InterACT: An interactive theorem prover for algebraic specifications - Springer
- 09-HuebnerEtAl.pdf
- [1410.7850] Proceedings Eleventh Workshop on User Interfaces for Theorem Provers
- A Generic Approach to Building User Interfaces for Theorem Provers
- 1105.4394v2.pdf
- CafeOBJ | Algebraic Specification and Verification
- - Album on Imgur
- Verified Software Toolchain
- STACK
- Robinson arithmetic - Wikipedia, the free encyclopedia
- *KirororO*[きろろろ]
- Fast and Loose Reasoning is Morally Correct - danielsson-et-al-popl2006.pdf
- Hubert Dreyfus's views on artificial intelligence - Wikipedia, the free encyclopedia
- EasyChair Proceedings: EPiC Series
- Added a proof that all polymorphic functions A -> A are id by jozefg · Pull Request #225 · jonsterling/JonPRL
- JonPRL - An proof refinement logic for computational type theory based on Brouwer-realizability & meaning explanations. Inspired by Nuprl
- Proof that typing is undecidable by jozefg · Pull Request #228 · jonsterling/JonPRL
- JonPRL - An proof refinement logic for computational type theory based on Brouwer-realizability & meaning explanations. Inspired by Nuprl
- lens: Lenses, Folds and Traversals | Hackage
- CS 323 - Automated Reasoning
- Dynamic logic (modal logic) - Wikipedia, the free encyclopedia
- 东方同人音乐博物馆【红】【387P】(24)_音乐选集_音乐_bilibili_哔哩哔哩弹幕视频网
- 自制 封面画师推特id遗失
- [inria-00285752, v1] Towards automatic proofs of lock-free algorithms - ec2-08-fejoz-merz.pdf
- lockfree.pdf
- Haskell for all: Why free monads matter
- Steering Behaviors · libgdx/gdx-ai Wiki
- gdx-ai - Artificial Intelligence framework for (libGDX) games [Steering Behaviors, Formation Motion, Pathfinding, Behavior Trees and Finite State Machines]
- Understanding Steering Behaviors: Seek - Tuts+ Game Development Tutorial
- Steering behaviors aim to help autonomous characters move in a realistic manner, by using simple forces that are combined to produce life-like, improvisational navigation around the characters' environment. In this tutorial I will cover the basic theory behind the seek steering behavior, as well as its implementation. | Difficulty: Intermediate; Length: Short; Tags: steering behaviors, Platform Agnostic, Flash, Programming, AS3, artificial intelligence, simulation, maths
- icfp088-coutts.pdf
- Scapegoat: John Dewey and the character education crisis - Journal of Moral Education - Volume 44, Issue 2
- Microsoft Word - 95.1 - 95.pdf
- UW Libraries Search - school value teaching conflict
- dijkstra.pdf
- identity type in nLab
- Just Kidding: Understanding Identity Elimination in Homotopy Type Theory | Homotopy Type Theory
- Several current proof assistants, such as Agda and Epigram, provide uniqueness of identity proofs (UIP): any two proofs of the same propositional equality are themselves propositionally equal. Homotopy type theory generalizes this picture to account for higher-dimensional types, where UIP does not hold--e.g. a universe (type of types), where equality is taken to be isomorphism,…
- Intuitionistic type theory - Wikipedia, the free encyclopedia
- Cartesian closed category - Wikipedia, the free encyclopedia
- mscs11.pdf
- FrankHB / YSLib / source / doc / NPL.txt — Bitbucket
- Kalah - Wikipedia, the free encyclopedia
- braibant/invert
- Contribute to invert development by creating an account on GitHub.
- paper.pdf
- The SMT-LIB Standard - smt-lib-reference-v2.5-r2015-06-28.pdf
- 60枚 的 Twitter: “チルノ http://t.co/e7qppYSagq”
- [1105.2576] TRX: A Formally Verified Parser Interpreter
- Linear Sized Types in the Calculus of Constructions - flops14.pdf
- Type-Based Productivity of Stream Definitions in the Calculus of Constructions - lics13.pdf
- Mathematical Components - Microsoft Research Inria Joint Centre
- Formal Methods for mathematics, distributed systems and security - Microsoft Research Inria Joint Centre
- Machine Learning & Big Data - Microsoft Research Inria Joint Centre
- White-Box Search-Based Software Engineering - Microsoft Research Inria Joint Centre
- Mathematical Components
- Polarity in Type Theory | Existential Type
- There has recently arisen some misguided claims about a supposed opposition between functional and object-oriented programming. The claims amount to a belated recognition of a fundamental structure in type theory first elucidated by Jean-Marc Andreoli, and developed in depth by Jean-Yves Girard in the context of logic, and by Paul Blain-Levy and Noam Zeilberger in…
- Inside 206-105
- From Semantics to Computer Science: Essays in Honour of Gilles Kahn - Yves Bertot - Google 图书
- Gilles Kahn was one of the most influential figures in the development of computer science and information technology, not only in Europe but throughout the world. This volume of articles by several leading computer scientists serves as a fitting memorial to Kahn's achievements and reflects the broad range of subjects to which he contributed through his scientific research and his work at INRIA, the French National Institute for Research in Computer Science and Control. The editors also reflect upon the future of computing: how it will develop as a subject in itself and how it will affect other disciplines, from biology and medical informatics, to web and networks in general. Its breadth of coverage, topicality, originality and depth of contribution, make this book a stimulating read for all those interested in the future development of information technology.
- Interactive Theorem Proving with Tasks
- ResearchGate is a network dedicated to science and research. Connect, collaborate and discover scientific publications, jobs and conferences. All for free.
- Effect system - Wikipedia, the free encyclopedia
- effects.pdf
- typesandeffects.dvi - nielson-nielson-csd99.pdf
- Situation calculus - Wikipedia, the free encyclopedia
- John McCarthy's legacy
- recursive.dvi - recursive.pdf
- X-machine - Wikipedia, the free encyclopedia
- Abstracting Abstract Machines - vanhorn-might-icfp10.pdf
- TR197.pdf
- tool_lists/verification_synthesis.md at 2c496240d090b227226d8a67c4ed7f8dc4adc6e7 · johnyf/tool_lists
- tool_lists - Links to tools by subject
- PII: 0022-0000(78)90014-4 - milner-polymorphism.pdf
- The Principal Type-Scheme of an Object in Combinatory Logic on JSTOR
- JSTOR is a digital library of academic journals, books, and primary sources.
- 2002-031.pdf
- Bound - School of Haskell | FP Complete
- Edward Kmett | FP Complete
- Welcome to FP Haskell Center | FP Complete
- 东方同人音乐博物馆【红】【387P】(50)_音乐选集_音乐_bilibili_哔哩哔哩弹幕视频网
- 自制 封面画师推特id遗失
- Cryptography I - Stanford University | Coursera
- Cryptography I from Stanford University. Learn about the inner workings of cryptographic primitives and how to apply this knowledge in real-world applications! Take free online classes from 120+ top universities and educational organizations. We partner with schools like Stanford, Yale, Princeton, and others to offer courses in dozens of topics, from computer science to teaching and beyond. Whether you are pursuing a passion or looking to advance your career, Coursera provides open, free education for everyone.
- PhoasICFP08.pdf
- p1218-mcbride.dvi - haskell2004.pdf
- PHOAS For Free - School of Haskell | FP Complete
- The Comonad.Reader » Fast Circular Substitution
- main.pdf
- chlorophyll.pdf
- Reynolds_typesabpara.pdf
- The semantics of reflected proof
- ResearchGate is a network dedicated to science and research. Connect, collaborate and discover scientific publications, jobs and conferences. All for free.
- http://www.ats-lang.org/
- 东方同人音乐博物馆【红】【387P】(21)_音乐选集_音乐_bilibili_哔哩哔哩弹幕视频网
- 自制 封面画师推特id遗失
- Publications by Didier Rémy [ <a href="publications_abstracts.html">with abstracts</a>| <a href="publications.bib">BibTeX source file</a> ]
- mscs00.pdf
- tocl07.pdf
- Gentzen Calculi for Modal Propositional Logic (Trends in Logic): Francesca Poggiolesi: 9789048196692: Amazon.com: Books
- Gentzen Calculi for Modal Propositional Logic (Trends in Logic) [Francesca Poggiolesi] on Amazon.com. *FREE* shipping on qualifying offers. The book is about Gentzen calculi for (the main systems of) modal logic. It is divided into three parts. In the first part we introduce and discuss the main philosophical ideas related to proof theory
- Amazon.com: Displaying Modal Logic (Trends in Logic) (9780792352051): Heinrich Wansing: Books
- Amazon.com: Displaying Modal Logic (Trends in Logic) (9780792352051): Heinrich Wansing: Books
- ptml_final.pdf
- Term algebra - Wikipedia, the free encyclopedia
- The Mercury Project: Documentation
- The Mercury Project: Papers and Presentations
- The Mercury Project: Deep profiler demo
- Two Turing Machines — #yfl
- For fun I wrote two universal Turing machines: one in Prolog, one in Mercury. This led me to some observations about type systems and their spheres of utility.
- The Mercury Project: Papers and Presentations
- Basic Category Theory for Computer Scientists (Foundations of Computing): Benjamin C. Pierce: 9780262660716: Amazon.com: Books
- Basic Category Theory for Computer Scientists (Foundations of Computing) [Benjamin C. Pierce] on Amazon.com. *FREE* shipping on qualifying offers. <P>Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science
- Proof Development with Ωmega: The Irrationality of \sqrt 2 - Springer
- OMEGA: Agent-oriented Proof Planning
- ResearchGate is a network dedicated to science and research. Connect, collaborate and discover scientific publications, jobs and conferences. All for free.
- On the Comparison of Proof Planning Systems: , Ωmega and IsaPlanner - 1-s2.0-S1571066106001113-main.pdf
- Proof planning with multiple strategies
- Agent Based Mathematical Reasoning
- FREQUENTLY ASKED QUESTIONS ABOUT PROOF PLANNING
- 111_1.tif - BundyA_The Use of Explicit.pdf
- [1404.6602v1] The Dafny Integrated Development Environment
- 1404.6602v1.pdf
- Extending the Reach and Power of Deductive Program Verification - thesis-klebanov.pdf
- Dafny: A language and program verifier for functional correctness - Microsoft Research
- Dafny is an experimental language that explores the dynamic frames style of specifications in an object-based sequential setting.
- [0708.0713] Edit and verify
- Computer-Aided Reasoning: An Approach
- async-isabelle-scala.pdf
- system.pdf
- Name binding blog | A blog all about techniques for handling name binding
- A blog all about techniques for handling name binding (by Dominic Mulligan)
- 15-819 Homotopy Type Theory
- Carnegie Mellon Homotopy Type Theory Course
- Free monad - HaskellWiki
- Memetic algorithm - Wikipedia, the free encyclopedia
- might2007diss.pdf
- Even a Geek Can Speak: Joey Asher: 9780978577605: Amazon.com: Books
- Even a Geek Can Speak [Joey Asher] on Amazon.com. *FREE* shipping on qualifying offers. In today's high-tech world, it's cool to be a geek. But it's not cool to talk like a geek. Even a Geek Can Speak</i> shows anyone how to express complex ideas in ways that are simple
- Amazon.com: Writing for Computer Science (9781852338022): Justin Zobel: Books
- Amazon.com: Writing for Computer Science (9781852338022): Justin Zobel: Books
- Synsem.pdf
- The Duality of Construction - Springer
- congruence-extended.pdf
- viewcontent.cgi
- Controlled Grammatic Ambiguity
- ResearchGate is a network dedicated to science and research. Connect, collaborate and discover scientific publications, jobs and conferences. All for free.
- The structure of a programming language revolution
- ResearchGate is a network dedicated to science and research. Connect, collaborate and discover scientific publications, jobs and conferences. All for free.
- Lambda Associates 2015
- 17 Creating Languages
- Rig.pdf
- BRICS-RS-01-16.pdf
- natural deduction in nLab
- epic.pdf
- Computer Laboratory: Ohad's Research - Agda Course 2013
- Ohad Kammar's Research
- osa1 - index
- TotallyFree.pdf
- Programming Language Checklist
- p290-blum.pdf
- machine-independent theory of the complexity of recursive functions - Bing
- theory of universal artificial intelligence based on algorithmic complexity. - Bing
- B-Method - Wikipedia, the free encyclopedia
- Mathematische Logik - www.minlog-system.de
- propositional calculus - How or why does intutionistic logic proof negations from within the theory, constructively? - Mathematics Stack Exchange
- Embedded in Academia : Stochastic Superoptimization
- jessica-taylor/mcmc-synthesis
- mcmc-synthesis - MCMC applied to program synthesis
- scala - What does "coalgebra" mean in the context of programming? - Stack Overflow
- Embedded in Academia : Computer Science Culture Clash
- haskell - What is indexed monad? - Stack Overflow
- Robustness and evolvability of programming languages
- genetic programming
- nystroemJohanThesis.pdf
- Microsoft Word - Japan.doc - japan.pdf
- Empirical study towards a leading indicator for cost of formal software verification
- Amazon.com: Natural Deduction: A Proof-Theoretical Study (Dover Books on Mathematics) (9780486446554): Dag Prawitz, Mathematics: Books
- Amazon.com: Natural Deduction: A Proof-Theoretical Study (Dover Books on Mathematics) (9780486446554): Dag Prawitz, Mathematics: Books
- How to implement dependent type theory I | Mathematics and Computation
- Language composition untangled
- Modular and automated type-soundness verification for language extensions
- A Language Designer's Workbench
- Modular specification and dynamic enforcement of syntactic language constraints when generating code
- IEEE Xplore Abstract - From Programming to Modeling - and Back Again
- IEEE Xplore. Delivering full text access to the world's highest quality technical literature in engineering and technology.
- A foundation for embedded languages
- Unembedding domain-specific languages
- IEEE Xplore Abstract (Cited By) - Programs are Knowledge Bases
- IEEE Xplore. Delivering full text access to the world's highest quality technical literature in engineering and technology.
- IEEE Xplore Abstract (Cited By) - Partial Domain Comprehension in Software Evolution and Maintenance
- IEEE Xplore. Delivering full text access to the world's highest quality technical literature in engineering and technology.
- mbeddr
- The Converge programming language. - Middlesex University Research Repository
- Information on Middlesex University's Research Repository: a online collection of Middlesex University's research outputs
- fool09.pdf
- Typed self-representation
- Towards typing for small-step direct reflection
- Typed self-interpretation by pattern matching
- vub-prog-phd-06-01.pdf
- Feature-oriented language families
- Exploring Collective DSL Integration in a Large Situated IS
- Feature-oriented language families
- Product lines of theorems
- TinkerType: a language for playing with formal systems
- A tactic language for the system Coq
- Automatically Deriving Schematic Theorems for Dynamic Contexts
- Type-Directed Elaboration of Quasiquotations
- Constraint based strategies
- Automated certification of implicit induction proofs
- Effective interactive proofs for higher-order imperative programs
- An operational foundation for the tactic language of Coq
- Typed syntactic meta-programming
- Safe composition of product lines
- An Algebra for Features and Feature Composition
- Features, modularity, and variation points
- Separating features using colored snippet graphs
- Integrating approaches for feature implementation
- The Choice Calculus
- A calculus for modeling and implementing variation
- Projectional editing of variational software
- An error-tolerant type system for variational lambda calculus
- A variability-aware module system
- Towards modular analysis of multi product lines
- Emergent feature modularization
- Extending Type Inference to Variational Programs
- The road to feature modularity?
- Features and object capabilities
- FEATUREHOUSE
- Exploring automated software composition with genetic programming
- Object-oriented design in feature-oriented programming
- A design feature-based approach to deriving program code from features
- FeatureC++
- Feature-interaction detection based on feature-based specifications
- Structural feature interaction patterns
- N degrees of separation
- Row types for delta-oriented programming
- First-Class Compositions - Springer
- Language factories
- Growing a Language: The GLoo Perspective - Springer
- Self-aware, Evolving Eternal Systems
- Few real software systems are built completely from scratch nowadays. Instead, systems are built iteratively and incrementally, while integrating and interacting with components from many other systems. These systems also last longer than their developers might imagine --- they are, in effect, eternal. Nevertheless the platforms, tools and environments we use to develop software are still largely based on an outmoded model that presupposes that software systems are closed and will not significantly evolve after deployment. We claim that in order to enable effective and graceful evolution of eternal systems, we must make them self-aware. A self-aware eternal system supports evolution by: (i) providing explicit, first-class models of software artifacts, change and history at the level of the platform, (ii) continuously analysing static and dynamic evolution to track emergent properties, and (iii) closing the gap between the domain model and the developers' view of the evolving system. We outline our vision of self-aware eternal systems and identify the research challenges to realizing this vision.
- Building Adaptive Language Systems | Kollar | INFOCOMP Journal of Computer Science
- Building Adaptive Language Systems
- IEEE Xplore Abstract - Compiler Design for Hyper-metaprogramming
- IEEE Xplore. Delivering full text access to the world's highest quality technical literature in engineering and technology.
- First class grammars for language oriented programming. - Middlesex University Research Repository
- Information on Middlesex University's Research Repository: a online collection of Middlesex University's research outputs
- Confusion in the Church-Turing Thesis
- ResearchGate is a network dedicated to science and research. Connect, collaborate and discover scientific publications, jobs and conferences. All for free.
- [1410.7103] Confusion in the Church-Turing Thesis
- Inductive programming - Wikipedia, the free encyclopedia
- TRAC (programming language) - Wikipedia, the free encyclopedia
- TTM (programming language) - Wikipedia, the free encyclopedia
- Self-Representation in Girard's System U
- A framework for extensible languages
- oopsla_sugarj.pdf
- Modular specification and dynamic enforcement of syntactic language constraints when generating code
- Composable and hygienic typed syntax macros
- Language and IDE Modularization and Composition with MPS - Springer
- Languages as libraries
- Multilingual component programming in racket
- Progressive types
- Terra
- Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromises
- owled2009_submission_16.pdf
- Language subsetting via reflection and overloading
- CiteSeerX — Growing a Language in Pattern Calculus
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Pattern calculus treats all computation as pattern matching, which is, in turn, central to the implementation of programming languages. Hence, its realisation in the general-purpose language bondi provides a natural host in which to develop domain-specific languages (DSLs). bondi is a strongly typed language that supports mixing of all the programming styles required for language implementation, including imperative programming (for handling input streams), functional programming (for transforming abstract syntax trees), generic queries (for performing traversals) and object-orientation (for growing DSLs). The approach is illustrated by growing a small combinatory language in which each language feature, i.e. each production of each grammar, is isolated within a single object-oriented class that captures the rules for parsing, type inference, evaluation and printing. Further, growth is used to support lambda-abstraction and pattern matching, providing good evidence that this combinatory language could grow to support all of bondi. 1
- User-Defined Reductions
- jfp-mtac.pdf
- pnp.pdf
- explicitPTS.pdf
- Alstroemeria Records
- logic - What is the optimal algorithm for the game 2048? - Stack Overflow
- category theory - What does "homomorphism" require that "morphism" doesn't? - Mathematics Stack Exchange
- Formal Specification of Programming Languages: A Panoramic Primer
- ResearchGate is a network dedicated to science and research. Connect, collaborate and discover scientific publications, jobs and conferences. All for free.
- The Axiomatic Semantics of Programs Based on Hoare's Logic.
- ResearchGate is a network dedicated to science and research. Connect, collaborate and discover scientific publications, jobs and conferences. All for free.
- Saaman.pdf
- Introduction.pdf - IntroductionPrintOut.pdf
- Formal Specifications of Programming Language
- Microsoft PowerPoint - draft-shin-sdn-formal-specification - slides-84-sdnrg-1.pdf
- Specification language - Wikipedia, the free encyclopedia
- Experience from the standardization of the SIMULA programming language - Palme - 2006 - Software: Practice and Experience - Wiley Online Library
- CS84010-R.pdf
- H75 - Notes.pdf
- Chaos: Making a New Science - James Gleick - Google 图书
- The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick that reveals the science behind chaos theory National bestseller More than a million copies sold A work of popular science in the tradition of Stephen Hawking and Carl Sagan, this 20th-anniversary edition of James Gleick's groundbreaking bestseller Chaos introduces a whole new readership to chaos theory, one of the most significant waves of scientific knowledge in our time. From Edward Lorenz's discovery of the Butterfly Effect, to Mitchell Feigenbaum's calculation of a universal constant, to Benoit Mandelbrot's concept of fractals, which created a new geometry of nature, Gleick's engaging narrative focuses on the key figures whose genius converged to chart an innovative direction for science. In Chaos,Gleick makes the story of chaos theory not only fascinating but also accessible to beginners, and opens our eyes to a surprising new view of the universe.
- The Elegant Universe: Superstrings, Hidden Dimensions, and the Quest for the ... - Brian Greene - Google 图书
- A new edition of the New York Times bestseller—now a three-part Nova special: a fascinating and thought-provoking journey through the mysteries of space, time, and matter. Now with a new preface (not in any other edition) that will review the enormous public reception of the relatively obscure string theory—made possible by this book and an increased number of adherents amongst physicists—The Elegant Universe "sets a standard that will be hard to beat" (New York Times Book Review). Brian Greene, one of the world's leading string theorists, peels away the layers of mystery surrounding string theory to reveal a universe that consists of eleven dimensions, where the fabric of space tears and repairs itself, and all matter—from the smallest quarks to the most gargantuan supernovas—is generated by the vibrations of microscopically tiny loops of energy. Today physicists and mathematicians throughout the world are feverishly working on one of the most ambitious theories ever proposed: superstring theory. String theory, as it is often called, is the key to the Unified Field Theory that eluded Einstein for more than thirty years. Finally, the century-old antagonism between the large and the small-General Relativity and Quantum Theory-is resolved. String theory proclaims that all of the wondrous happenings in the universe, from the frantic dancing of subatomic quarks to the majestic swirling of heavenly galaxies, are reflections of one grand physical principle and manifestations of one single entity: microscopically tiny vibrating loops of energy, a billionth of a billionth the size of an atom. In this brilliantly articulated and refreshingly clear book, Greene relates the scientific story and the human struggle behind twentieth-century physics' search for a theory of everything. Through the masterful use of metaphor and analogy, The Elegant Universe makes some of the most sophisticated concepts ever contemplated viscerally accessible and thoroughly entertaining, bringing us closer than ever to understanding how the universe works.
- Philosophical Investigations: The German Text, with a Revised English ... - Ludwig Wittgenstein - Google 图书
- The Philosophical Investigations of Ludwig Wittgenstein (1889-1951) present his own distillation of two decades of intense work on the philosophies of mind, language and meaning.
- Why People Believe Weird Things: Pseudoscience, Superstition, and Other ... - Michael Shermer - Google 图书
- Revised and Expanded Edition.In this age of supposed scientific enlightenment, many people still believe in mind reading, past-life regression theory, New Age hokum, and alien abduction. A no-holds-barred assault on popular superstitions and prejudices, with more than 80,000 copies in print, Why People Believe Weird Things debunks these nonsensical claims and explores the very human reasons people find otherworldly phenomena, conspiracy theories, and cults so appealing. In an entirely new chapter, "Why Smart People Believe in Weird Things," Michael Shermer takes on science luminaries like physicist Frank Tippler and others, who hide their spiritual beliefs behind the trappings of science.Shermer, science historian and true crusader, also reveals the more dangerous side of such illogical thinking, including Holocaust denial, the recovered-memory movement, the satanic ritual abuse scare, and other modern crazes. Why People Believe Strange Things is an eye-opening resource for the most gullible among us and those who want to protect them.
- The Art of War by Sun Tzu - Classic Edition - Sun Tzu, Shawn Conners, Lionel Giles - Google 图书
- This collectible edition of "The Art of War by Sun Tzu" presents these timeless instructions regarding military strategy and managing conflict in two complete versions, with over 260 pages of content. A modern introduction, tracing the origins of "The Art of War" and its historical and cultural importance, firmly grounds the reader in the context with which the oldest book on military strategy has survived the ages, as well as contemporary examples of its continued use. The first section of this collectible edition contains "The Art of War" in English, without notes or commentary. This allows the reader to understand the teachings of Sun Tzu, without the distraction of footnotes or excessive comments. The second section contains the complete annotated translation by Lionel Giles, restored by Sian Kim, along with Giles' translation notes, definitive critical commentary, and supplemental information from a broad range of sources. Written during the Victorian era, Giles' 1910 "Introduction" has also been included, containing the legend of "Sun Tzu and The Army of Concubines." Although written in the 6th century BC, the teachings of Sun Tzu are still found today in the martial arts, legal doctrine, military schools, management seminars and pervasively throughout popular culture.
- Ishmael: An Adventure of the Mind and Spirit - Daniel Quinn - Google 图书
- MORE THAN ONE MILLION COPIES IN PRINTThe narrator of this extraordinary tale is a man in search for truth. He answers an ad in a local newspaper from a teacher looking for serious pupils, only to find himself alone in an abandoned office with a full-grown gorilla who is nibbling delicately on a slender branch. “You are the teacher?” he asks incredulously. “I am the teacher,” the gorilla replies. Ishmael is a creature of immense wisdom and he has a story to tell, one that no other human being has ever heard. It is a story that extends backward and forward over the lifespan of the earth from the birth of time to a future there is still time to save. Like all great teachers, Ishmael refuses to make the lesson easy; he demands the final illumination to come from within ourselves. Is it man’s destiny to rule the world? Or is it a higher destiny possible for him—one more wonderful than he has ever imagined?From the Trade Paperback edition.
- Zen and the Art of Motorcycle Maintenance: An Inquiry Into Values - Robert M. Pirsig - Google 图书
- One of the most important and influential books written in the past half-century, Robert M. Pirsig's Zen and the Art of Motorcycle Maintenance is a powerful, moving, and penetrating examination of how we live . . . and a breathtaking meditation on how to live better. Here is the book that transformed a generation: an unforgettable narration of a summer motorcycle trip across America's Northwest, undertaken by a father and his young son. A story of love and fear -- of growth, discovery, and acceptance -- that becomes a profound personal and philosophical odyssey into life's fundamental questions, this uniquely exhilarating modern classic is both touching and transcendent, resonant with the myriad confusions of existence . . . and the small, essential triumphs that propel us forward.
- Tao Te Ching - Lao-Tzu - Google 图书
- The Tao Te Ching is a spiritual, inspirational work that guides us through life, helping us to live within each moment and find the beauty that is all around each of us. Simple, beautiful, and life changing. The Tao Te Ching is fundamental to the Taoist school of Chinese philosophy (Dojia) and strongly influenced other schools, such as Legalism and Neo-Confucianism. This ancient book is also central in Chinese Buddhism, which when first introduced into China was largely interpreted through the use of Taoist words and concepts. Many Chinese artists, including poets, painters, calligraphers, and even gardeners have used the Tao Te Ching as a source of inspiration.
- The Magic Cauldron
- Homesteading the Noosphere
- principle of equivalence in nLab
- A Gentle Introduction to Abstract Algebra - 必应
- Haskell/Understanding arrows - Wikibooks, open books for an open world
- The RBJones.com Home Page
- The RBJones.com Home Page.
- Kappa calculus - Wikipedia, the free encyclopedia
- p1218-mcbride.dvi - haskell2004.pdf
- Proof Theory: Sequent Calculi and Related Formalisms (Hardback) - Routledge
- Although sequent calculi constitute an important category of proof systems, they are not as well known as axiomatic and natural deduction systems. Addressing this deficiency, Proof Theory: Sequent Calculi and Related Formalisms presents a comprehensive…
- msj2.dvi - msj2.pdf
- Control.Monad
- pdf8CWEySO3AL.pdf
- 23920144.DVI - C11.pdf
- CiteSeerX — A multi-modi Proof Planner
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Proof planning is a novel knowledge-based approach for proof construction, which supports the incorporation of mathematical knowledge and the common mathematical proof techniques of a particular mathematical field. This paradigm is adopted in the\Omega mega proof development system, to provide support for the user. A considerable part of the proof construction and even sometimes the whole work can be undertaken by a proof planner. In the \Omega mega project we are investigating the aspect of computation under bounded resources in mathematical theorem proving. The relevant resources are, in addition to time and memory space, user availability as well as the frequency of user interaction. At this issue, the proof planner of\Omega mega is conceived in such a way that it has a resource-adaptive behaviour. This property of the planner is achieved by a planner modus which defines the planner behaviour depending on which and how many resources are available. In this paper, we describe the...
- CiteSeerX — L\Omega UI: A Distributed Graphical User Interface for the Interactive Proof System\Omega mega. Submitted to the International Workshop on User Interfaces for Theorem Provers
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Most interactive proof development environments are insu cient to handle the complexity of the information to be conveyed to the user and to support his orientation in large-scale proofs. In this paper we present a distributed client-server extension of the mega proof development system, focusing on the L UI (Lovely mega User Interface) client. This graphical user interface provides advanced communication facilities through an adaptable proof tree visualization and through various selective proof object display methods. Some of L UI's main features are the graphical display of co-references in proof graphs, a selective term browser, and support for dynamically adding knowledge to partial proofs {allbased upon and implemented in a client-server architecture. 1
- CiteSeerX — Critical Agents Supporting Interactive Theorem Proving
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): We introduce a resource adaptive agent mechanism which supports the user of an interactive theorem proving system. The mechanism, an extension of [4], uses a two layered architecture of agent societies to suggest applicable commands together with appropriate command argument instantiations. Experiments with this approach show that its effectiveness can be further improved by introducing a resource concept. In this paper we provide an abstract view on the overall mechanism, motivate the necessity of an appropriate resource concept and discuss its realization within the agent architecture.
- CiteSeerX — Resource Adaptive Agents in Interactive Theorem Proving
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): We introduce a resource adaptive agent mechanism which supports the user in interactive theorem proving. The mechanism, an extension of [4], uses a two layered architecture of agent societies to suggest appropriate commands together with possible command argument instantiations. Experiments with this approach show that its e ectiveness can be further improved by introducing a resource concept. In this paper we provide an abstract view on the overall mechanism, motivate the necessity of an appropriate resource concept and discuss its realization within the agent architecture. 1
- CiteSeerX — Citation Query Introduction to HOL: a theorem proving environment for higher-order logic
- CiteSeerX - Scientific documents that cite the following paper: Introduction to HOL: a theorem proving environment for higher-order logic
- CiteSeerX — The Oz Programming Model
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): The Oz Programming Model (OPM) is a concurrent programming model subsuming higher-order functional and object-oriented programming as facets of a general model. This is particularly interesting for concurrent object-oriented programming, for which no comprehensive formal model existed until now. The model
- CiteSeerX — Citation Query An Introduction to Mathematical Logic and Type Theory
- CiteSeerX - Scientific documents that cite the following paper: An Introduction to Mathematical Logic and Type Theory
- CiteSeerX — Citation Query Resource Management for Boundedly Optimal Agent Societies
- CiteSeerX - Scientific documents that cite the following paper: Resource Management for Boundedly Optimal Agent Societies
- CiteSeerX — A blackboard architecture for guiding interactive proofs
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract. The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestion mechanism for commands. Such mechanisms support the user by decreasing the necessary interactions during the proof construction. Although many systems offer such facilities, they are often limited in their functionality. In this paper we present a new agent-based mechanism that independently observes the proof state, steadily computes suggestions on how to further construct the proof, and communicates these suggestions to the user via a graphical user interface. We furthermore introduce a focus technique in order to restrict the search space when deriving default suggestions. Although the agents we discuss in this paper are rather simple from a computational viewpoint, we indicate how the presented approach can be extended in order to increase its deductive power. 1
- CiteSeerX — Citation Query Blackboard Systems
- CiteSeerX - Scientific documents that cite the following paper: Blackboard Systems
- CiteSeerX — mega: Towards a mathematical assistant
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract. mega is a mixed-initiative system with the ultimate purpose of supporting theorem proving in main-stream mathematics and mathematics education. The current system consists of a proof planner and an integrated collection of tools for formulating problems, proving subproblems, and proof presentation. 1
- Laziness as a Comonad · Louis Dionne
- Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic Probability (Texts in Theoretical Computer Science. An EATCS Series): Marcus Hutter: 9783642060526: Amazon.com: Books
- Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic Probability (Texts in Theoretical Computer Science. An EATCS Series) [Marcus Hutter] on Amazon.com. *FREE* shipping on qualifying offers. <P>This book presents sequential decision theory from a novel algorithmic information theory perspective. While the former is suited for active agents in known environments
- in theory | "Marge, I agree with you – in theory. In theory, communism works. In theory." — Homer Simpson
- "Marge, I agree with you - in theory. In theory, communism works. In theory." -- Homer Simpson (by luca)
- Informal History Of Programming Ideas
- Forces Vs Consequences
- pluggable-types.pdf
- Yann LeCun: What's so great about "Extreme Learning Machines"? : MachineLearning
- Yann LeCun's thoughts about ELMs: > What's so great about "Extreme Learning Machines"? > > There is an interesting sociological phenomenon...
- Programming in Martin-Lof's Type Theory
- Stochastic Lambda Calculus and Monads of Probability Distributions (Abstract)
- Felicific calculus - Wikipedia, the free encyclopedia
- Amateras Records
- Amateras Records
- statusfailed - Haskell's strength: generalising with lenses
- Varying lens properties by instance · ekmett/lens Wiki
- Lenses, Folds, and Traversals - Join us on freenode #haskell-lens
- On the Static Nature of Traversals
- haskell - How to abstract over a "back and forth" transformation? - Stack Overflow
- A Neighborhood of Infinity: Profunctors in Haskell
- TXL (programming language) - Wikipedia, the free encyclopedia
- TXL Home Page
- TXL
- The TXL source transformation language
- 六离合释:健康宏展开的故事
- [1402.1699] A Representation Theorem for Second-Order Functionals
- [1103.2841] Functor is to Lens as Applicative is to Biplate: Introducing Multiplate
- Mathematical Structures in Computer Science - Classical mathematics for a constructive world - Cambridge Journals Online
- Interactive theorem provers based on dependent type theory have the flexibility to support both constructive and classical reasoning. Constructive reasoning is supported natively by dependent type theory, and classical reasoning is typically supported by adding additional non-constructive axioms. However, there is another perspective that views constructive logic as an extension of classical logic. This paper will illustrate how classical reasoning can be supported in a practical manner inside dependent type theory without additional axioms. We will show several examples of how classical results can be applied to constructive mathematics. Finally, we will show how to extend this perspective from logic to mathematics by representing classical function spaces using a weak value monad.
- A computer-verified monadic functional implementation of the integral
- Certified Exact Transcendental Real Number Computation in Coq - Springer
- Mathematical Structures in Computer Science - Fulltext - A monadic, functional implementation of real numbers - Cambridge Journals Online
- Large scale real number computation is an essential ingredient in several modern mathematical proofs. Because such lengthy computations cannot be verified by hand, some mathematicians want to use software proof assistants to verify the correctness of these proofs. This paper develops a new implementation of the constructive real numbers and elementary functions for such proofs by using the monad properties of the completion operation on metric spaces. Bishop and Bridges's notion (Bishop and Bridges 1985) of regular sequences is generalised to what I call regular functions, which form the completion of any metric space. Using the monad operations, continuous functions on length spaces (which are a common subclass of metric spaces) are created by lifting continuous functions on the original space. A prototype Haskell implementation has been created. I believe that this approach yields a real number library that is reasonably efficient for computation, and still simple enough to verify its correctness easily.
- Interactive Programming | Lambda the Ultimate
- Enumerating the Rationals | Lambda the Ultimate
- 20 Years of PLDI (1979-1999): <p> A Selection <p>
- Metalua
- Stratego Program Transformation Language
- The Spoofax Language Workbench – MetaBorg
- All about Spoofax
- Stratego/XT - Wikipedia, the free encyclopedia
- Natural Language Semantics
- Linguistics papers and talks, often about applications of delimited continuations to formal semantics and pragmatics
- mlasson/paramcoq
- paramcoq - Coq plugin for parametricity
- obseqnow.pdf
- Extensional Equality in Intensional Type Theory. T. Altenkirch - Bing
- A New Approach for Automatic Theorem Proving in Real Geometry
- ResearchGate is a network dedicated to science and research. Connect, collaborate and discover scientific publications, jobs and conferences. All for free.
- Logix: Multi-Language Programming | Lambda the Ultimate
- Back to the language roots | Lambda the Ultimate
- Choosing a Language for Interactive Fiction | Lambda the Ultimate
- How birds learn songs | Lambda the Ultimate
- Links (Wadler) | Lambda the Ultimate
- Lazy K | Lambda the Ultimate
- The IDE Divide | Lambda the Ultimate
- Denotational Semantics: A Methodology for Language Development | Lambda the Ultimate
- The Blue Calculus
- Proof and Counterexample | Lambda the Ultimate
- A New Approach to Abstract Syntax with Variable Binding | Lambda the Ultimate
- Fortress focuses on the needs of scientists | Lambda the Ultimate
- The POPLmark Challenge | Lambda the Ultimate
- Jon Udell: Languages and environments | Lambda the Ultimate
- Lisp-Stat does not seem to be in good health lately. | Lambda the Ultimate
- Games for Logic and Programming Languages: Etaps'05 | Lambda the Ultimate
- Higher-Order Perl | Lambda the Ultimate
- On the Unusual Effectiveness of Logic in Computer Science | Lambda the Ultimate
- Computer generates verifiable mathematics proof | Lambda the Ultimate
- Why Dependent Types Matter | Lambda the Ultimate
- Bidirectional fold and scan | Lambda the Ultimate
- Variables as Channels | Lambda the Ultimate
- From shift and reset to polarized linear logic | Lambda the Ultimate
- Backtracking, Interleaving, and Terminating Monad Transformers | Lambda the Ultimate
- Should Computer Science Get Rid of Protocols? | Lambda the Ultimate
- An Operational Semantics for R5RS Scheme | Lambda the Ultimate
- FLOPS 2006 | Lambda the Ultimate
- Propositional Satisfiability and Constraint Programming: A comparative Survey | Lambda the Ultimate
- Linear types for aliased resources | Lambda the Ultimate
- Journal "Logical Methods in CS" | Lambda the Ultimate
- Multigame A Very High Level Language for Describing Board Games | Lambda the Ultimate
- C#: Yesterday, Today, and Tomorrow: An Interview with Anders Hejlsberg | Lambda the Ultimate
- Alloy: A Simple Structural Modeling Language Based on First-Order Logic | Lambda the Ultimate
- Software Factories at OOPSLA 2005 | Lambda the Ultimate
- Monads in Ruby | Lambda the Ultimate
- Putting Curry-Howard to Work | Lambda the Ultimate
- Djinn, a theorem prover in Haskell, for Haskell. | Lambda the Ultimate
- Language affects 'half of vision' | Lambda the Ultimate
- Exceptional syntax | Lambda the Ultimate
- Combinators for contracts | Lambda the Ultimate
- Programming Languages: Application and Interpretation | Lambda the Ultimate
- Inverse typechecker and theorem proving in intuitionistic and classical logics | Lambda the Ultimate
- eWeek: 'Exotic' Programming Tools Go Mainstream | Lambda the Ultimate
- Stroustrup: A Brief Look at C++0x | Lambda the Ultimate
- When is one thing equal to some other thing? | Lambda the Ultimate
- Towards Applicative Relational Programming | Lambda the Ultimate
- LiteratePrograms wiki | Lambda the Ultimate
- The Theory of Classification - A Course on OO Type Systems | Lambda the Ultimate
- What do you believe about Programming Languages (that you can't prove (yet))? | Lambda the Ultimate
- Open data types and open functions | Lambda the Ultimate
- Computer Science Looks for a Remake | Lambda the Ultimate
- Micro-Kanren | Lambda the Ultimate
- Automath | Lambda the Ultimate
- Designing Components with the C++ STL | Lambda the Ultimate
- The Weird World of Bi-Directional Programming | Lambda the Ultimate
- Constraint Programming | Lambda the Ultimate
- R6RS Status Report | Lambda the Ultimate
- Charles Babbage Institute | Lambda the Ultimate
- A Mobility Calculus with Local and Dependent Types | Lambda the Ultimate
- A brief survey of quantum programming languages | Lambda the Ultimate
- Concoqtion: Mixing Indexed Types and Hindley-Milner Type Inference | Lambda the Ultimate
- New blog: A Fistful of Languages | Lambda the Ultimate
- A Core Calculus for Scala Type Checking | Lambda the Ultimate
- Ivor, a proof engine | Lambda the Ultimate
- Programming Languages in the Markup World | Lambda the Ultimate
- Gradual Typing for Functional Languages | Lambda the Ultimate
- ICFP proceedings / Scheme workshop | Lambda the Ultimate
- Is "post OO" just over? | Lambda the Ultimate
- Ruby metaprogramming techniques | Lambda the Ultimate
- Arrows, like Monads, are Monoids | Lambda the Ultimate
- Machine Obstructed Proof | Lambda the Ultimate
- A rationale for semantically enhanced library languages | Lambda the Ultimate
- Mechanized Metatheory Model-Checking | Lambda the Ultimate
- [Redux] A Syntactic Approach to Type Soundness (1992) | Lambda the Ultimate
- Ralph Griswold died | Lambda the Ultimate
- Delimited Control for PLT Scheme | Lambda the Ultimate
- YubNub for Programming Language Research | Lambda the Ultimate
- Comparing Approaches to Generic Programming in Haskell | Lambda the Ultimate
- Practical Type Inference Based on Success Typings | Lambda the Ultimate
- Matching Objects With Patterns | Lambda the Ultimate
- Why numbering should start at 0 | Lambda the Ultimate
- Annotated POPL 2007 Program | Lambda the Ultimate
- ''The Paradigms of Programming'' online | Lambda the Ultimate
- Generic Programming, Now! | Lambda the Ultimate
- Ralf Lammel: Stop dysfunctional programming | Lambda the Ultimate
- Programming Shorthands | Lambda the Ultimate
- Termination Checking with Types | Lambda the Ultimate
- The Design and Implementation of a Dataflow Language for Scriptable Debugging | Lambda the Ultimate
- Lightweight static resources | Lambda the Ultimate
- Kourier is now live | Lambda the Ultimate
- Ed Felten: Why Understanding Programs is Hard | Lambda the Ultimate
- Finite State Machines in Forth | Lambda the Ultimate
- CFP: Programming Languages for Mechanized Mathematics Workshop | Lambda the Ultimate
- Expressing Heap-shape Contracts in Linear Logic | Lambda the Ultimate
- A Topos Foundation for Theories of Physics | Lambda the Ultimate
- An Intensional Type Theory: Motivation and Cut-Elimination | Lambda the Ultimate
- Separation Logic courses (Reynolds) | Lambda the Ultimate
- No Ifs, Ands, or Buts | Lambda the Ultimate
- A Temporal Logic Language for Context Awareness in Pointcuts | Lambda the Ultimate
- The expression problem, Scandinavian style | Lambda the Ultimate
- Python in Pardus Linux | Lambda the Ultimate
- Singularity: Rethinking the Software Stack | Lambda the Ultimate
- A Natural Axiomatization of Church's Thesis | Lambda the Ultimate
- Lambda Animator | Lambda the Ultimate
- Generational Real-time Garbage Collection | Lambda the Ultimate
- Garbage Collection Without Paging | Lambda the Ultimate
- Relationally-Parametric Polymorphic Contracts | Lambda the Ultimate
- Validity Invariants and Effects | Lambda the Ultimate
- Online video course on monads | Lambda the Ultimate
- Idioms for Composing Games with Etoys | Lambda the Ultimate
- Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach | Lambda the Ultimate
- Theorem proving support in programming language semantics | Lambda the Ultimate
- A Dialogue on Infinity | Lambda the Ultimate
- Closing the Stage: From Staged Code to Typed Closures | Lambda the Ultimate
- CUFP write-up | Lambda the Ultimate
- Kermeta Programming Language | Lambda the Ultimate
- The YNot Project | Lambda the Ultimate
- Eriskay: a Programming Language Based on Game Semantics | Lambda the Ultimate
- April 1st special: The War of the Worlds | Lambda the Ultimate
- program verification: the very idea | Lambda the Ultimate
- Chris Crawford's 9 Breakthroughs | Lambda the Ultimate
- Register Allocation by Proof Transformation | Lambda the Ultimate
- Language geek at the Maker Faire | Lambda the Ultimate
- Applied Proof Theory: Proof Interpretations and their Use in Mathematics | Lambda the Ultimate
- Computational Thinking | Lambda the Ultimate
- Project Coverage | Lambda the Ultimate
- AgentSpeak(L): programming with beliefs, desires and intentions | Lambda the Ultimate
- agentspeak-lncs.dvi - agentspeakl-rao.pdf
- SEP entry on Combinatory Logic | Lambda the Ultimate
- Microsoft PDC "Language" Talks | Lambda the Ultimate
- The programming languages behind "the mother of all demos" | Lambda the Ultimate
- Type inference for correspondence types | Lambda the Ultimate
- AMS: A Special Issue on Formal Proof | Lambda the Ultimate
- HOPL III: The When, Why and Why Not of the BETA Programming Language | Lambda the Ultimate
- PL Grand Challenges | Lambda the Ultimate
- On the Strength of Proof-Irrelevant Type Theories | Lambda the Ultimate
- A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking | Lambda the Ultimate
- LNGen | Lambda the Ultimate
- Fully-parameterized, first-class modules with hygienic macros | Lambda the Ultimate
- Factor Mixins | Lambda the Ultimate
- Verified Programming in Guru | Lambda the Ultimate
- Observational Equality, Now! | Lambda the Ultimate
- π: a pattern language | Lambda the Ultimate
- Causal Commutative Arrows and Their Optimization | Lambda the Ultimate
- Have your AHOS and eat HOAS too! | Lambda the Ultimate
- A Type-theoretic Foundation for Programming with Higher-order Abstract Syntax and First-class Substitutions | Lambda the Ultimate
- Announcing a Fortress blog | Lambda the Ultimate
- Pattern Calculus | Lambda the Ultimate
- Semantic types: a fresh look at the ideal model for types | Lambda the Ultimate
- An Innocent Model of Linear Logic | Lambda the Ultimate
- ParaSail, a new language oriented toward parallelism and verification | Lambda the Ultimate
- Designing ParaSail, a new programming language
- Free logic books | Lambda the Ultimate
- Extending the Scope of Syntactic Abstraction | Lambda the Ultimate
- Handlers of Algebraic Effects | Lambda the Ultimate
- Traceable Data Types for Self-Adjusting Computation | Lambda the Ultimate
- What Sequential Games, the Tychonoff Theorem and the Double-Negation Shift have in Common | Lambda the Ultimate
- App Inventor: Programming for non-programmers... again | Lambda the Ultimate
- Omega - Language of the Future | Lambda the Ultimate
- Abstract interpreters for free | Lambda the Ultimate
- Generative Type Abstraction and Type-level Computation | Lambda the Ultimate
- Erasure and Polymorphism in Pure Type Systems | Lambda the Ultimate
- Using Hackage to Inform Language Design | Lambda the Ultimate
- Directly Reflective Meta-Programming | Lambda the Ultimate
- The Habit Programming Language: The Revised Preliminary Report | Lambda the Ultimate
- Asynchronous Proof Processing with Isabelle/Scala and Isabelle/jEdit | Lambda the Ultimate
- modules are anti-modular | Lambda the Ultimate
- A Semantic Model for Graphical User Interfaces | Lambda the Ultimate
- The Experimental Effectiveness of Mathematical Proof | Lambda the Ultimate
- CiteSeerX — Software Engineering with Formal Methods: The Development of a Storm Surge Barrier Control System - Revisiting Seven Myths of Formal Methods
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): This paper discusses the use of formal methods in the development of the control system for the Maeslant Kering. The Maeslant Kering is the movable dam which has to protect Rotterdam from floodings while, at (almost) the same time, not restricting ship traffic to the port of Rotterdam. The control system, called BOS, completely autonomously decides about closing and opening of the barrier and, when necessary, also performs these tasks without human intervention. BOS is a safety-critical software system of the highest Safety Integrity Level according to IEC 61508. One of the reliability increasing techniques used during its development is formal methods. This paper reports experiences obtained from using formal methods in the development of BOS. These experiences are presented in the context of Hall's famous "Seven Myths of Formal Methods".
- Deca, an LtU-friendly bare metal systems programming language | Lambda the Ultimate
- When Formal Systems Kill: Computer Ethics and Formal Methods | Lambda the Ultimate
- Parsing: The Solved Problem That Isn't | Lambda the Ultimate
- What does focusing tell us about language design? | Lambda the Ultimate
- Simple Generators v. Lazy Evaluation | Lambda the Ultimate
- Pure Subtype Systems | Lambda the Ultimate
- LVars: monotonic update for deterministic parallel programming | Lambda the Ultimate
- Copatterns: the final approach to codata? | Lambda the Ultimate
- Types for Flexible Objects | Lambda the Ultimate
- PuzzleScript | Lambda the Ultimate
- The marriage of bisimulations and Kripke logical relations | Lambda the Ultimate
- Re-thinking Prolog | Lambda the Ultimate
- Cost semantics for functional languages | Lambda the Ultimate
- Conservation laws for free! | Lambda the Ultimate
- Seemingly impossible programs | Lambda the Ultimate
- Breaking the Complexity Barrier of Pure Functional Programs with Impure Data Structures | Lambda the Ultimate
- Self-Representation in Girard’s System U | Lambda the Ultimate
- Draining the Swamp: Micro Virtual Machines as Solid Foundation for Language Development | Lambda the Ultimate
- FLOPS 2016, promoting cross-fertilization across the whole declarative programming and theory and practice | Lambda the Ultimate
- The Unison Programming Platform | Lambda the Ultimate
- Cakes, Custard, and Category Theory | Lambda the Ultimate
- Making stricterness more relevant
- ResearchGate is a network dedicated to science and research. Connect, collaborate and discover scientific publications, jobs and conferences. All for free.
- tacc-hs09.pdf
- Laziness by Need - Springer
- JLP94bis.dvi - lpsynt_jlp.pdf
- 411.tf4 - scott93tcs.pdf
- MI-7-Ch6-BoyerMoore.pdf
- MI6-Ch24-ElcockEtAl.pdf
- CiteSeerX — Application of theorem proving to problem solving
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): This paper shows how an extension of the resolution proof procedure can be used to construct problem solutions. The extended proof procedure can solve problems involving state transformations. The paper explores several alternate problem representations and provides a discussion of solutions to sample problems including the "Monkey and Bananas " puzzle and the 'Tower of Hanoi " puzzle. The paper exhibits solutions to these problems obtained by QA3, a computer program bused on these theorem-proving methods. In addition, the paper shows how QA3 can write simple computer programs and can solve practical problems for a simple robot. Key Words: Theorem proving, resolution, problem solving, automatic programming, program writing, robots, state transformations, question answering. Automatic theorem proving by the resolution proof procedure § represents perhaps the most powerful known method for automatically determining the validity of a statement of first-order logic. In an earlier paper Green and Raphael" illustrated how an extended resolution procedure can be used as a question answerer—e.g., if the statement (3x)P(x) can be shown to follow from a set of axioms by the resolution proof procedure, then the extended proof procedure will find or construct an x that satisfies P(x). This earlier paper (1) showed how one can axiomatize simple question-answering subjects, (2) described a question-answering program called QA2 based on this procedure, and (3) presented examples of simple question-answering dialogues with QA2. In a more recent paper " the author (1) presents the answer construction method in detail and proves its correctness, (2) describes the latest version of the program, QA3, and (3) introduces state-transformation methods into the constructive proof formalism. In addition to the question-answering applications illustrated in these earlier papers, QA3 has been used as an SRI robot 4 problem solver and as an automatic
- cd.dvi - cd.pdf
- Computational Logic: Structure sharing and proof of program properties
- Beyond FRP: physics-inspired programming abstractions? | Lambda the Ultimate
- Bob Harper of CMU is blogging about programming languages and introductory CS education | Lambda the Ultimate
- A Growable Language Manifesto | Lambda the Ultimate
- FL programming language | Lambda the Ultimate
- How useful is reflection, anyway? | Lambda the Ultimate
- A name for this form of variable capture? | Lambda the Ultimate
- Category theory in design | Lambda the Ultimate
- what a type system always proves vs. what it can be made to prove | Lambda the Ultimate
- Influence of cognitive models on programming language design | Lambda the Ultimate
- Why type systems are interesting | Lambda the Ultimate
- What to do about comments? | Lambda the Ultimate
- The A-Z of Programming Languages: Falcon - Computerworld
- Our series on the most popular programming languages continues as we chat to Falcon creator Giancarlo Niccolai
- Information Distribution Aspects of Design Methodology,
- The role of documentation in the design and implementation of complex systems is explored, resulting in suggestions in sharp contrast with current practice. The concept of system structure is studied by examining the meaning of the phrase 'connections between modules.' It is shown that several system design goals (each suggesting a partial time ordering of the decisions) may be inconsistent. Some properties of programmers are discussed. System documentation, which makes all information accessible to anyone working on the project, is discussed. The thesis that such information 'broadcasting' is harmful, that it is helpful if most system information is hidden from most programmers, is supported by use of the above mentioned considerations as well as by examples. An information hiding technique of documentation is given in the appendix. (Author)(*COMPUTER PROGRAMMING
- A design methodology for reliable software systems
- Chapter III: Hierarchical program structures
- Global variable considered harmful
- OOPSLA Keynote: The Power Of Abstraction
- In a reprise of her ACM Turing Award lecture, Barbara Liskov discusses the invention of abstract data types, the CLU programming language, clusters, polymorphism, exception handling, iterators, implementation inheritance, type hierarchies, the Liskov Substitution Principle, polymorphism, and future challenges such as new abstractions, parallelism, and the Internet.
- Microsoft PowerPoint - turing-09-5 - turing-09-5.pdf
- SCG: Research
- SCG: SCG Wiki
- SCG: Publications
- Computer Algebra Systems: A Practical Guide
- UC Berkeley computer algebra papers
- Computer Algebra Systems
- Computer Algebra and Symbolic Computation: Elementary Algorithms
- Computer Algebra and Symbolic Computation: Mathematical Methods
- Plugging Haskell in
- LNCS 3302 - Build, Augment and Destroy, Universally - aplas04.pdf
- Run time type checking | Lambda the Ultimate
- I've run out of programming languages to study | Lambda the Ultimate
- Making implicits less powerful? | Lambda the Ultimate
- Qi 6.1 released | Lambda the Ultimate
- Solomon Feferman, Deciding the undecidable: Wrestling with Hilbert's problems - PhilPapers
- In the year 1900, the German mathematician David Hilbert gave a dramatic address in Paris, at the meeting of the 2nd International Congress of Mathematicians—an address which was to have lasting ...
- deciding.pdf
- Willpower: Rediscovering the Greatest Human Strength: Roy F. Baumeister, John Tierney: 9780143122234: Amazon.com: Books
- Willpower: Rediscovering the Greatest Human Strength [Roy F. Baumeister, John Tierney] on Amazon.com. *FREE* shipping on qualifying offers. Pioneering research psychologist Roy F. Baumeister collaborates with New York Times</i> science writer John Tierney to revolutionize our understanding of the most coveted human virtue: self-control. Drawing on cutting-edge research and the wisdom of real-life experts
- Amazon.com: Introduction to Logic (9780415226752): Harry Gensler: Books
- Amazon.com: Introduction to Logic (9780415226752): Harry Gensler: Books
- Mathematical Logic, 2nd Edition (Undergraduate Texts in Mathematics): H.-D. Ebbinghaus, J. Flum, Wolfgang Thomas: 9780387942582: Amazon.com: Books
- Mathematical Logic, 2nd Edition (Undergraduate Texts in Mathematics) [H.-D. Ebbinghaus, J. Flum, Wolfgang Thomas] on Amazon.com. *FREE* shipping on qualifying offers. <P>This introduction to first-order logic clearly works out the role of first-order logic in the foundations of mathematics
- Gödel's Theorem: An Incomplete Guide to Its Use and Abuse: Torkel Franzén: 9781568812380: Amazon.com: Books
- Gödel's Theorem: An Incomplete Guide to Its Use and Abuse [Torkel Franzén] on Amazon.com. *FREE* shipping on qualifying offers. Among the many expositions of Gödel's incompleteness theorems written for non-specialists, this book stands apart. With exceptional clarity
- Getting What You Came For: The Smart Student's Guide to Earning an M.A. or a Ph.D.: Robert Peters: 9780374524777: Amazon.com: Books
- Getting What You Came For: The Smart Student's Guide to Earning an M.A. or a Ph.D. [Robert Peters] on Amazon.com. *FREE* shipping on qualifying offers. Is graduate school right for you? Should you get a master's or a Ph.D.? How can you choose the best possible school? This classic guide helps students answer these vital questions and much more. It will also help graduate students finish in less time
- Graduate School: Winning Strategies for Getting in: Dave G. Mumby, Ph.D., Bleu Quest: 9780968217368: Amazon.com: Books
- Graduate School: Winning Strategies for Getting in [Dave G. Mumby, Ph.D., Bleu Quest] on Amazon.com. *FREE* shipping on qualifying offers. This book provides college students with all the information and advice they need to apply successfully to graduate school. In chapters 1 to 4 several misconceptions about graduate school are revealed and dispelled
- Department of Computer Science, University of Oxford: Tony Hoare : Publications
- Publications, by date, Department of Computer Science, Oxford, Tony Hoare
- A Look Back: Why We Wrote Design Patterns: Elements of Reusable Object-Oriented Software | 'Design Patterns: Elements of Reusable Object-Oriented Software | InformIT
- On the 15th anniversary of the publication of the Gang of Four's Design Patterns, we are republishing this article written in 1994 for Addison-Wesley's Innovations newsletter.
- Essential programming paradigm
- http://www.jot.fm/issues/issue_2006_03/column1/
- mcdirmid06superglue.pdf
- JetBrains onBoard Online Magazine :: Fabrique - a code generator
- Programming by demonstration - Wikipedia, the free encyclopedia
- Language-oriented programming - Wikipedia, the free encyclopedia
- Semantic-oriented programming - Wikipedia, the free encyclopedia
- The Concept-Oriented Portal
- Software factory - Wikipedia, the free encyclopedia
- Laurence Tratt: Language Orientated Programming
- mpc08.pdf
- The ternary Goldbach conjecture | The value of the variable
- So now everybody knows why I was posting more and more rarely. I recently posted a proof of the ternary Goldbach conjecture: it was split into two articles - a new one on major arcs, and a new and improved version of the article on minor arcs I wrote last year. Of course, I'm expected…
- Gottlob Frege - Wikipedia, the free encyclopedia
- computational trinitarianism in nLab
- CiteSeerX — Citation Query Programming by Action Clusters
- CiteSeerX - Scientific documents that cite the following paper: Programming by Action Clusters
- FOOL 12
- oopsla2015.pdf
- wax2015.pdf
- How programming languages will co-evolve with software engineering: a bright decade ahead
- Quantified types in an imperative language
- A Monadic Framework for Subcontinuations | Lambda the Ultimate
- Old Neglected Theorems Are Still Theorems | Existential Type
- I have very recently been thinking about the question of partiality vs totality in programming languages, a perennial topic in PL's that every generation thinks it discovers for itself. And this got me to remembering an old theorem that, it seems, hardly anyone knows ever existed in the first place. What I like about the theorem…
- There Is Such A Thing As A Declarative Language, and It’s The World’s Best DSL | Existential Type
- In a recent post I asked whether there is any such thing as a declarative language. The main point was to argue that the standard "definitions" are, at best, not very precise, and to see whether anyone might offer a better definition. What I'm after is an explanation of why people seem to think that…
- Constructive Mathematics Is Not Metamathematics | Existential Type
- The publication of the Homotopy Type Theory book has renewed interest in type theory as a foundation for mathematics, and spurred computer scientists to investigate the computational meaning of higher-dimensional types. As I mentioned in a previous post, what makes HoTT work so well for homotopy theory is that it is constructive, which means, at…
- What’s the Big Deal About HoTT? | Existential Type
- Now that the Homotopy Type Theory book is out, a lot of people are asking "What's the big deal?". The full answer lies within the book itself (or, at any rate, the fullest answer to date), but I am sure that many of us who were involved in its creation will be fielding this question…
- Univalent Foundations at IAS | Existential Type
- As many of you may know, the Institute for Advanced Study is sponsoring a year-long program, called "Univalent Foundations for Mathematics" (UF), which is developing the theory and applications of Homotopy Type Theory (HTT). The UF program is organized by Steve Awodey (CMU), Thierry Coquand (Chalmers), and Vladimir Voevodsky (IAS). About two dozen people are in residence…
- Haskell Is Exceptionally Unsafe | Existential Type
- It is well known that Haskell is not type safe. The most blatant violation is the sometimes-necessary, and aptly named, unsafePerformIO operation. You are enjoined not to use this in an unsafe manner, and must be careful to ensure that the encapsulated computation may be executed at any time because of the inherent unpredictability of lazy…
- Extensionality, Intensionality, and Brouwer’s Dictum | Existential Type
- There seems to be a popular misunderstanding about the propositions-as-types principle that has led some to believe that intensional type theory (ITT) is somehow preferable to or more sensible than extensional type theory (ETT). Now, as a practical matter, few would dispute that ETT is much easier to use than ITT for mechanizing everyday mathematics.…
- Church’s Law | Existential Type
- A new feature of this year's summer school was a reduction in the number of lectures, and an addition of daily open problem sessions for reviewing the day's material. This turned out to be a great idea for everyone, because it gave us more informal time together, and gave the students a better chance at…
- Types and Cells | Existential Type
- The doctrine of computational trinitarianism implies that there should be a categorial analogue of two-dimensional type theory ... and indeed there is. It is called, oddly enough, two-dimensional category theory, which arose first for numerous reasons. What is two-dimensional category theory? And how does it relate to two-dimensional type theory? Two-dimensional category theory may be seen…
- Higher-Dimensional Type Theory | Existential Type
- Ideas have their time, and it's not for us to choose when they arrive. But when they do, they almost always occur to many people at more or less the same time, often in a slightly disguised form whose underlying unity becomes apparent only later. This is perhaps not too surprising, the same seeds taking…
- The Point of Laziness | Existential Type
- As I've discussed previously, there are a number of good reasons why Haskell is not suitable for teaching introductory functional programming. Chief among these is laziness, which in the context of a pure functional language has fatal side effects. First, Haskell suffers from a paucity of types. It is not possible in Haskell to define…
- Persistence of Memory | Existential Type
- Salvador Dali's masterpiece, The Persistence of Memory, is one of the most recognizable works of art in the world. The critic Dawn Ades described it as "a Surrealist meditation on the collapse of our notions of a fixed cosmic order" induced by Einstein's penetrating analysis of the concepts of time and space in the physical…
- The Holy Trinity | Existential Type
- The Christian doctrine of trinitarianism states that there is one God that is manifest in three persons, the Father, the Son, and the Holy Spirit, who together form the Holy Trinity. The doctrine of computational trinitarianism holds that computation manifests itself in three forms: proofs of propositions, programs of a type, and mappings between…
- Boolean Blindness | Existential Type
- I hate Booleans! But isn't everything "just bits"? Aren't computers built from gates? And aren't gates just the logical connectives? How can a Computer Scientist possibly hate Booleans? Fritz Henglein recently pointed out to me that the world of theoretical Computer Science is divided into two camps, which I'll call the logicians (who are concerned…
- Konstantin Weitz
- Konstantin Weitz
- Items where Subject is "Computer Science > Language" - Cogprints
- godel_k.dvi - godel_k.pdf
- ill_k.dvi - ill_k.pdf
- PROGRAMS WITH COMMON SENSE
- PROGRAMS WITH COMMON SENSE
- hana/template.cpp at master · ldionne/hana
- hana - Your standard library for metaprogramming
- A type discipline for authorization policies - Microsoft Research
- Bret Victor on Live Coding | TOPLAP
- main.dvi - icfp77-perera.pdf
- Selected Papers on Computer Science (Lecture Notes): Donald E. Knuth: 9781881526919: Amazon.com: Books
- Selected Papers on Computer Science (Lecture Notes) [Donald E. Knuth] on Amazon.com. *FREE* shipping on qualifying offers. <div>This still timely collection of papers by Donald Knuth, the father of computer science, surveys the field of computer science and the nature of algorithms. Topics covered here include the relationship between computer science and mathematics
- Amazon.com: Combinatorial Problems and Exercises (9780821842621): Laszlo Lovasz: Books
- Amazon.com: Combinatorial Problems and Exercises (AMS Chelsea Publishing) (9780821842621): Laszlo Lovasz: Books
- The New Turing Omnibus: Sixty-Six Excursions in Computer Science: A. K. Dewdney: 9780805071665: Amazon.com: Books
- The New Turing Omnibus: Sixty-Six Excursions in Computer Science [A. K. Dewdney] on Amazon.com. *FREE* shipping on qualifying offers. No other volume provides as broad, as thorough, or as accessible an introduction to the realm of computers as A. K. Dewdney's The Turing Omnibus.</i> Updated and expanded
- Amazon.com: Proofs without Words: Exercises in Visual Thinking (Classroom Resource Materials) (v. 1) (9780883857007): Roger B. Nelsen: Books
- Amazon.com: Proofs without Words: Exercises in Visual Thinking (Classroom Resource Materials) (v. 1) (9780883857007): Roger B. Nelsen: Books
- Proofs Without Words II: More Exercises in Visual Thinking (Classroom Resource Materials) (v. 2): Roger B. Nelsen: 9780883857212: Amazon.com: Books
- Proofs Without Words II: More Exercises in Visual Thinking (Classroom Resource Materials) (v. 2) [Roger B. Nelsen] on Amazon.com. *FREE* shipping on qualifying offers. Like its predecessor, Proofs without Words, this book is a collection of pictures or diagrams that help the reader see why a particular mathematical statement may be true
- Advanced Metaprogramming in Classic C++: 9781484210116: Computer Science Books @ Amazon.com
- Advanced Metaprogramming in Classic C++: 9781484210116: Computer Science Books @ Amazon.com
- Luis von Ahn: Massive-scale online collaboration | TED Talk | TED.com
- After re-purposing CAPTCHA so each human-typed response helps digitize books, Luis von Ahn wondered how else to use small contributions by many on the Internet for greater good. In this talk, he shares how his ambitious new project, Duolingo, will help millions learn a new language while translating the Web quickly and accurately -- all for free.
- Extensional concepts in intensional type theory
- () - continuity.pdf
- IvyWiki : Home Page
- CiteSeerX — An intuitionistic theory of types
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): An earlier, not yet conclusive, attempt at formulating a theory of this kind was made by Scott 1970. Also related, although less closely, are the type and logic free theories of constructions of Kreisel 1962 and 1965 and Goodman 1970. In its first version, the present theory was based on the strongly impredicative axiom that there is a type of all types whatsoever, which is at the same time a type and an object of that type. This axiom had to be abandoned, however, after it was shown to lead to a contradiction by Jean Yves Girard. I am very grateful to him for showing me his paradox. The change that it necessitated is so drastic that my theory no longer contains intuitionistic simple type theory as it originally did. Instead, its proof theoretic strength should be close to that of predicative analysis.
- Konstantin Weitz
- C&C - Two Different Flavors of Type Theory
- krml203.pdf
- Using Dafny, an Automatic Program Verifier - krml221.pdf
- Microsoft Word - Lectures.docx - Lectures.pdf
- EECS-2008-177.pdf
- siek06:_gradual.pdf
- Soft typing: An approach to type checking for dynamically typed languages
- The Truncation Map |_| : ℕ -> ‖ℕ‖ is nearly Invertible | Homotopy Type Theory
- Magic tricks are often entertaining, sometimes boring, and in some rarer cases astonishing. For me, the following trick belongs to the third type: the magician asks a volunteer in the audience to think of a natural number. The volunteer secretly chooses a number n. As a proof that he has really chosen a number, he…
- Tangible Program Histories - Microsoft Research
- Q - Equational Programming Language
- Ben Zorn - Microsoft Research
- Church Project
- Yale FLINT Group: Home
- Cryptology ePrint Archive: Report 2008/471
- Cryptology ePrint Archive: Report 2007/401
- Zero-knowledge Type-checker
- zk-types-full.pdf
- The Hume Programming Language
- PL vs. PX | Lambda the Ultimate
- krml236.pdf
- Psychology of Programming Interest Group | Psychology of Programming Interest Group
- The structure of a programming language revolution
- FPW'14
- Trade-offs in software design and delivery
- Software engineering as live performance
- A pattern of language evolution
- A snapshot of studio based learning
- Lisp50
- On Sustaining Self
- Presentation: "50 in 50"
- The structure of a programming language revolution - p195-gabriel.pdf
- Can't Be Built
- Ultra-large-scale systems
- Conscientious software
- Breakthrough ideas
- Fostering software robustness in an increasingly hostile world
- Extreme Programming as a Teaching Process
- Back to the future (panel session)
- Patterns of software
- Counterpoint
- CLOS in context
- Neoclassical object-oriented techniques: multimethods
- The design of parallel programming languages
- CLOS
- The common LISP object system
- Design of an optimizing, dynamically retargetable compiler for common Lisp
- programming-as-experience.pdf
- A Self Bibliography — Self Papers 4.5.0 documentation
- Building a VM — Self Handbook for Self 4.5.0 documentation
- Works by Seymour Papert, Ph.D.
- Watch What I Do
- Watch What I Do: Programming by Demonstration. Edited by Allen Cypher.
1993, MIT Press, 652 pages. The motivation behind Programming by Demonstration
is simple and compelling: if a user knows how to perform a task on the
computer, that should be sufficient to create a program to perform the task. It
should not be necessary to learn a programming language like C or BASIC.
Instead, the user should be able to instruct the computer to
- Brad Myers's Home Page
- Seymour Papert - Wikipedia, the free encyclopedia
- No Title
- coq-ext-lib/coq-ext-lib · GitHub
- coq-ext-lib - A library of Coq definitions, theorems, and tactics.
- gmalecha/coq-plugin-utils · GitHub
- coq-plugin-utils - Useful utility functions for writing Coq plugins
- pl.programming languages - Program reasoning about own source code - Theoretical Computer Science Stack Exchange
- pl.programming languages - In which posets is the set of compact elements downwards closed? - Theoretical Computer Science Stack Exchange
- lo.logic - Reference for the fact that (0=1) implies false requires a universe in MLTT - Theoretical Computer Science Stack Exchange
- lo.logic - Are there any annotated formal verification systems for pure functional programming languages? - Theoretical Computer Science Stack Exchange
- What requirements should a denotational semantics for a programming language satisfy to be correct? - Theoretical Computer Science Stack Exchange
- Use of Process Calculi and PL Theory for modern programming language development - Theoretical Computer Science Stack Exchange
- ds.algorithms - Is there a programming language where any arbitrary recursive function can be fused? - Theoretical Computer Science Stack Exchange
- Language with extensible type system? - Theoretical Computer Science Stack Exchange
- Homoiconic languages which are not Turing complete - Theoretical Computer Science Stack Exchange
- pl.programming languages - How to make the Lambda Calculus strong normalizing without a type system? - Theoretical Computer Science Stack Exchange
- reference request - Can one automate algorithmic analysis? - Theoretical Computer Science Stack Exchange
- pl.programming languages - Full Completeness vs Full Abstraction of a program translation - Theoretical Computer Science Stack Exchange
- lo.logic - What is the logarithm or root operation in type-space? - Theoretical Computer Science Stack Exchange
- reference request - Resumption-based IO systems? - Theoretical Computer Science Stack Exchange
- lo.logic - Will Martin-Löf Type Theory lead to a greater ability to write provably correct code? - Theoretical Computer Science Stack Exchange
- reference request - Parametricity and projective eliminations for dependent records - Theoretical Computer Science Stack Exchange
- computability - Class of functions computable by Coq - Theoretical Computer Science Stack Exchange
- pl.programming languages - Type classes vs object interfaces? - Theoretical Computer Science Stack Exchange
- reference request - Modeling objects (OOP) in dependent type theory - Theoretical Computer Science Stack Exchange
- pl.programming languages - When can we say that two programs are different? - Theoretical Computer Science Stack Exchange
- lo.logic - Curry-Howard and programs from non-constructive proofs - Theoretical Computer Science Stack Exchange
- Data structures in programming language with linear types - Theoretical Computer Science Stack Exchange
- ds.algorithms - Higher-order algorithms - Theoretical Computer Science Stack Exchange
- reference request - Books on programming language semantics - Theoretical Computer Science Stack Exchange
- ecoop-traits.pdf
- Untitled Document
- http://www.cs.berkeley.edu/~bodik/research/sketching-stanford-2004.ppt
- Algebraic semantics (mathematical logic) - Wikipedia, the free encyclopedia
- Cω - Wikipedia, the free encyclopedia
- Join-calculus - Wikipedia, the free encyclopedia
- A plea for lean software - Computer - wirth.pdf
- Abstract types have existential type - Bing
- Modules for Standard ML - Bing
- 08-Voelker.pdf
- 06-PolletMellisMeier.pdf
- 05-Kiniry.pdf
- Correctness of short cut fusion - HaskellWiki
- tlca03.pdf
- 50th Anniversary of the Manchester Baby computer
- Bertrand Meyer's technology+ blog » Blog Archive » New paper: Theory of Programs
- Chapter12.pdf
- Algebraic Semantics
- Archives: Lambda the Ultimate Weblogs
- Archives: Lambda the Ultimate Weblogs
- Inside every model of Abstract Stone Duality lies an Arithmetic Universe - Bing
- Concrete Data Structures as Games - Bing
- A graph-based semantics for object-oriented programming constructs - Bing
- Refinement Calculus
- Ralph-Johan Back
- Programming from Specifications
- Web edition of textbook on rigorous program development
- Logic_Algebraic_Effects.pdf
- Logic Matters | Logic, enthusiasms, sceptical thoughts, and a little LaTeX geekery
- Appendix.pdf
- About the Teach Yourself Logic Study Guide | Logic Matters
- Shorter TYL | Logic Matters
- Serious set theory | Logic Matters
- Category Theory | Logic Matters
- Book Notes | Logic Matters
- [1203.1539] Programming with Algebraic Effects and Handlers
- zeilberger.pdf
- pldi05-prospector.pdf
- How to Make Ad Hoc Proof Automation Less Ad Hoc
- lessadhoc-extended.pdf
- Magic Ink: Information Software and the Graphical Interface
- Edward Tufte: Books - The Visual Display of Quantitative Information
- Algorithmic Botany: Publications
- Algorithmic Botany: Publications
- Design and Implementation of the L+C Modeling Language
- Lemonodor: OOPSLA 2005
- Subtext programming language
- Manifesto of the Programmer Liberation Front
- LtU Classic Archives
- rosetta.pdf
- New Structures for Physics III | The n-Category Café
- The n-Category Café
- Peter Selinger: Papers
- ctfwp1_final.dvi - ctfwp1_final.pdf
- Rosetta Stone Project in Category Theory
- apr06.pdf
- On the size of machines
- A Haskell monad for infinite search in finite time | Mathematics and Computation
- Defunctionalization - Wikipedia, the free encyclopedia
- CMU-CS-14-114.pdf
- SCG: SCG
- ACM Classic Books Series
- ACM Classic Books Series
- Paul McJones's Home Page
- The Curse of the Excluded Middle - ACM Queue
- Creating Languages in Racket - ACM Queue
- Extensible Programming for the 21st Century - ACM Queue
- Languages, Levels, Libraries, and Longevity - ACM Queue
- A Conversation with Alan Kay - ACM Queue
- Barbara Liskov
- Andrew C. Myers
- Guy Blelloch
- Word.PDF - lampson73note.pdf
- Resources for Programming Language Research
- The 1998 ACM Computing Classification System — Association for Computing Machinery
- BRICS-RS-04-38.pdf
- Grundy-2006-RFL.pdf
- The reFLect Programming Language
- Reason maintenance - Wikipedia, the free encyclopedia
- Handbook of Paraconsistency (Studies in Logic): J. Y. Beziau, W. Carnielli, D. M. Gabbay: 9781904987734: Amazon.com: Books
- Handbook of Paraconsistency (Studies in Logic) [J. Y. Beziau, W. Carnielli, D. M. Gabbay] on Amazon.com. *FREE* shipping on qualifying offers. Paraconsistent logics are logics which allow solid deductive reasoning under contradictions by offering a mathematical and philosophical support to contradictory yet non-trivial theories. Due to its role in models of scientific reasoning and to its philosophical implications
- Logica Universalis - Towards a General Theory of Logic | Jean-Yves Beziau | Springer
- "I find this book extremely useful and important, because it signifies the arrival of a new renaissance in logic, a new revival not only of logic, but of
- The structure ot truth-values - 06.pdf
- The relativity and universality of logic - Springer
- Studies in Universal Logic
- This series is devoted to the universal approach to logic and the development of a general theory of logics. It covers topics such as global set-ups for fundamental theorems of logic and frameworks for the study of logics, in ...
- http://www.paraconsistency.org/wcp5.html
- Deviant logic - Wikipedia, the free encyclopedia
- Meta-ethics - Wikipedia, the free encyclopedia
- Deontic logic - Wikipedia, the free encyclopedia
- Knowledge management - Wikipedia, the free encyclopedia
- Paraconsistent mathematics - Wikipedia, the free encyclopedia
- A Paraconsistent Logic Programming Approach for Querying Inconsistent Knowledge Bases - Flairs05-122.pdf
- [1003.5976] From Quantum Metalanguage to the Logic of Qubits
- [0812.4614] I, Quantum Robot: Quantum Mind control on a Quantum Computer
- [1112.2923] The Uncertainty Relation for Quantum propositions
- [1205.1820] The non-algorithmic side of the mind
- TOPLAS3102-08.tex - toplas-complexity.pdf
- Handbook of Philosophical Logic: Dov M. Gabbay, Franz Guenthner: 9781402005831: Amazon.com: Books
- Handbook of Philosophical Logic [Dov M. Gabbay, Franz Guenthner] on Amazon.com. *FREE* shipping on qualifying offers. such questions for centuries (unrestricted by the capabilities of any hard ware). The principles governing the interaction of several processes
- The Elements Of Artificial Intelligence: An Introduction Using LISP: Amazon.com: Books
- The Elements Of Artificial Intelligence: An Introduction Using LISP on Amazon.com. *FREE* shipping on qualifying offers.
- Trade-offs with abstraction | Lambda the Ultimate
- Welcome to ERights.Org
- crazy PL idea: prescriptive trait inference | Lambda the Ultimate
- mcdirmid12.pdf - Microsoft Word Online
- Abstract algebraic logic - Wikipedia, the free encyclopedia
- Univalent foundations - Wikipedia, the free encyclopedia
- untitled - FOLDS.pdf
- newell_Simon_SymbolsSearch.pdf
- A Neighborhood of Infinity: Arboreal Isomorphisms from Nuclear Pennies
- SuperGinBaby | All of my systems come to naught.
- All of my systems come to naught.
- ListT done right - HaskellWiki
- A tutorial on the universality and expressiveness of fold - fold.pdf
- Bibliography of Scheme-related Research
- Online bibliography of Scheme research
- Visual Programming Languages research papers
- Watch What I Do: Table of Contents
- About the PL Enthusiast - The Programming Languages EnthusiastThe Programming Languages Enthusiast
- The Programming Languages Enthusiast - Developments in PL, and why they matterThe Programming Languages Enthusiast | Developments in PL, and why they matter
- Developments in PL, and why they matter
- A mechanized semantics for C++ object construction and destruction, with applications to resource management - ctor-dtor-popl12.pdf
- CiteSeerX — 4.1 The denotational semantics of Scheme
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract: Under what conditions does a physical system implement or realize a computation? Structuralism about computational implementation, espoused by Chalmers and others, holds that a physical system realizes a computation just in the case the system instantiates a pattern of causal organization isomorphic to the computation‟s formal structure. I argue against structuralism through counter-examples drawn from computer science. On my opposing view, computational implementation sometimes requires instantiating semantic properties that outstrip any relevant pattern of causal organization. In developing my argument, I defend antiindividualism about computational implementation: relations to the social environment sometimes help determine whether a physical system realizes a computation.
- ACL2 theorems about commercial microprocessors - Springer
- acl.pdf
- Mechanizing Proof | The MIT Press
- The Racket Blog: Small is Beautiful, Large is Useful, and Scheme is Both
- NU PLT
- John C. Mitchell Publications
- Fully abstract translations between functional languages
- Matthew Flatt: Publications
- gpce13-f-color.pdf
- Syntactic extensions in the programming language LISP - Google 搜索
- macromod.dvi - macromod.pdf
- Foundations for Programming Languages - Bing
- Axiom Computer Algebra System
- Programming in Standard ML - book.pdf
- popl2016.pdf
- How to Use Modules in PLT Scheme v200
- malcolm
- number-parameterized-types.dvi - number-parameterized-types.pdf
- Simon Peyton Jones: papers
- Simon Peyton Jones: papers
- Minsky, M. (1961). Steps towards artificial intelligence. - Bing
- The automaton representation and the notion of `can'
- The automaton representation and the notion of `can'
- REMARKS AND OPEN PROBLEMS
- REMARKS AND OPEN PROBLEMS
- DISCUSSION OF LITERATURE
- DISCUSSION OF LITERATURE
- Modal Logic
- Modal Logic
- Tense Logics
- Tense Logics
- Logics and Theories of Action
- Logics and Theories of Action
- Other Topics
- Other Topics
- What's new?
- SLIDES OF LECTURES ( 6-Jan-2007)
- WHAT IS AI? (12-Jul-1998)
- Formal Reasoning Group
- ELEPHANT (17-May-1996)
- A Basis for a Mathematical Theory of Computation ( 4-Jun-1996)
- TOWARDS A MATHEMATICAL SCIENCE OF COMPUTATION (23-Jun-1997)
- INVERSION OF FUNCTIONS DEFINED BY TURING MACHINES (31-Aug-1996)
- Programs with Common Sense (28-Feb-1999)
- Tough Nut for Proof Procedures
- The Mutilated Checkerboard in Set Theory (26-Apr-1996)
- Circumscription ( 1-Dec-2003)
- APPLICATIONS OF CIRCUMSCRIPTION TO FORMALIZING COMMON SENSE ( 1-Dec-2003)
- Ascribing Mental Qualities to Machines (12-Aug-2000)
- First Order Theories of Individual Concepts and Propositions (23-Apr-2004)
- Artificial Intelligence, Logic and Formalizing Common Sense (23-Apr-1996)
- Contexts ( 7-Jan-2001)
- Formalizing Context (Expanded Notes)
- Artificial Intelligence and Philosophy (23-Apr-1996)
- A LOGICAL AI APPROACH TO CONTEXT (28-Feb-1996)
- Making Robots Conscious of their Mental States (28-Apr-2007)
- SOME EXPERT SYSTEMS NEED COMMON SENSE (12-May-1996)
- THE LITTLE THOUGHTS OF THINKING MACHINES (14-May-1996)
- EPISTEMOLOGICAL PROBLEMS OF ARTIFICIAL INTELLIGENCE (15-May-1996)
- GENERALITY IN ARTIFICIAL INTELLIGENCE (15-May-1996)
- COLORING MAPS AND THE KOWALSKI DOCTRINE ( 5-Jun-1996)
- On the Model Theory of Knowledge
- On the Model Theory of Knowledge
- CREATIVE SOLUTIONS TO PROBLEMS (16-Mar-1999)
- COMBINING NARRATIVES ( 9-Jul-1999)
- Todd Moody's Zombies (28-Feb-1997)
- USEFUL COUNTERFACTUALS (23-May-2002)
- FREE WILL - EVEN FOR ROBOTS (21-Nov-2002)
- SIMPLE DETERMINISTIC FREE WILL (2005 March 37)
- ACTIONS AND OTHER EVENTS IN SITUATION CALCULUS (22-Nov-2004)
- OVERCOMING UNEXPECTED OBSTACLES (14-Apr-2001)
- FORMALIZATION OF TWO PUZZLES INVOLVING KNOWLEDGE (23-Dec-1997)
- ROOFS AND BOXES ( 6-Aug-1999)
- PARAMETERIZING THE SET OF MODELS OF A PROPOSITIONAL THEORY ( 3-Aug-1998)
- MODALITY, SI! MODAL LOGIC, NO! ( 4-Apr-1997)
- APPEARANCE AND REALITY (30-Aug-2006)
- CRITERIA FOR USEFULNESS OF COMPUTERS IN OFFICES ( 8-Jul-1999)
- SITUATION CALCULUS WITH CONCURRENT EVENTS AND NARRATIVE (27-Apr-2000)
- Concepts of Logical AI ( 9-May-1996)
- ELABORATION TOLERANCE ( 4-Apr-1998)
- FORMALIZATION OF STRIPS IN SITUATION CALCULUS (26-Oct-2002)
- BASIC TOPICS IN EXPERIMENTAL COMPUTER SCIENCE ( 2-Jun-1996)
- UNIVERSALITY: OR WHY THERE ARE SEPARATE SCIENCES (24-Dec-2003)
- Newell, Allen (1982): ``The Knowledge Level - Bing
- John McCarthy on Elephant 2000, Lisp, Ruby and the Computer Industry
- In this interview, John McCarthy presents his latest programming language ideas; Elephant 2000. He describes elephant memory, references to the past and to the future and how speach acts can be used in programming. He also presents his view on Lisp's influences on Ruby and his view of the history and current state of the computer industry.
- gigasquid/babar
- babar - A little language for machines with speech acts
- LX
- Mozart
- Home page for Mozart, an extensible development envionment
- STRIPS - Wikipedia, the free encyclopedia
- Planner (programming language) - Wikipedia, the free encyclopedia
- POP-11 - Wikipedia, the free encyclopedia
- Artificial Intelligence: Structures and Strategies for Complex Problem Solving
- George Luger's Artificial Intelligence
- Computational Intelligence: A Logical Approach
- Computational Intelligence: a
Logical Approach is a new textbook on
artificial intelligence (AI). It covers logic, reasoning,
representation, learning, probability, robotics, search, abduction, Prolog.
- Paradigms of AI Programming: Preface
- Operads, Type Level Nats, and Tic-Tac-Toe | Bartosz Milewski's Programming Cafe
- This summer I spent some time talking with Edward Kmett about lots of things. (Which really means that he was talking and I was trying to keep up.) One of the topics was operads. The ideas behind operads are not that hard, if you've heard about category theory. But the Haskell wizardry to implement them…
- Superintelligence: Paths, Dangers, Strategies: Nick Bostrom: 9780199678112: Amazon.com: Books
- Superintelligence: Paths, Dangers, Strategies [Nick Bostrom] on Amazon.com. *FREE* shipping on qualifying offers. <strong></strong><strong><em>A New York Times bestseller</em></strong><strong></strong> Superintelligence asks the questions: What happens when machines surpass humans in general intelligence? Will artificial agents save or destroy us? Nick Bostrom lays the foundation for understanding the future of humanity and intelligent life. The human brain has some capabilities that the brains of other animals lack. It is to these distinctive capabilities that our species owes its dominant position. If machine brains surpassed human brains in general intelligence
- How to Create a Mind: The Secret of Human Thought Revealed: Ray Kurzweil: 9780143124047: Amazon.com: Books
- How to Create a Mind: The Secret of Human Thought Revealed [Ray Kurzweil] on Amazon.com. *FREE* shipping on qualifying offers. <b>The bestselling author of The Singularity Is Near</i> explores the limitless potential of reverse-engineering the human brain</b> Ray Kurzweil is arguably today’s most influential futurist. In How to Create a Mind</i>
- Breaking The Habit of Being Yourself: How to Lose Your Mind and Create a New One: Dr. Joe Dispenza: 9781401938093: Amazon.com: Books
- Breaking The Habit of Being Yourself: How to Lose Your Mind and Create a New One [Dr. Joe Dispenza] on Amazon.com. *FREE* shipping on qualifying offers. <div><p class= HHCover-BodyText style= margin: 0in 0in 0pt > <p class= HHCover-BodyText style= margin: 0in 0in 0pt > You are not doomed by your genes and hardwired to be a certain way for the rest of your life. A new science is emerging that empowers all human beings to create the reality they choose. In <B><I>Breaking the Habit of Being Yourself
- Boost C++ Libraries
- A mechanized axiom free inductive proof of the unrestricted Kruskal's tree theorem
- Spirit 3.0.0
- The Art of Doing Science and Engineering: Learning to Learn - Hamming-TheArtOfDoingScienceAndEngineering.pdf
- Bret Victor, beast of burden
- Bret Victor has been provided by the management for your protection.
- Richard Feynman and The Connection Machine - The Long Now
- We Really Don't Know How To Compute!
- Gerald Jay Sussman compares our computational skills with the genome, concluding that we are way behind in creating complex systems such as living organisms, and proposing a few areas of improvement.
- keep-hearn-dybvig-paper-sfp12.pdf
- deputy-esop07.pdf
- C&C - Home
- Luca-Cardelli-Fest-MSR-TR-2014-104.pdf
- Towards a quantum programming language
- ResearchGate is a network dedicated to science and research. Connect, collaborate and discover scientific publications, jobs and conferences. All for free.
- book-whole.pdf
- mathematics education - Relating Category Theory to Programming Language Theory - MathOverflow
- [0903.0340] Physics, Topology, Logic and Computation: A Rosetta Stone
- [0904.4921] Renormalization and computation I: motivation and background
- popl13.pdf
- nonterm.pdf
- Arithmetical hierarchy - Wikipedia, the free encyclopedia
- Reflective Reasoning With and Between a Declarative Metatheory and the Implementation Code
- ResearchGate is a network dedicated to science and research. Connect, collaborate and discover scientific publications, jobs and conferences. All for free.
- download
- metarew.pdf
- Conversational_Programming.pdf
- Room 101: Making Methods Live
- Tangible Functional Programming
- arXiv:0904.4921v2 [math.QA] 25 Aug 2009 - 0904.4921v2
- Reflection and its application to mechanized metareasoning about programming languages - CaltechTHESIS
- Paper2-Morgan.pdf
- brownplt/LambdaJS
- LambdaJS - Semantics and tools for JavaScript
- fosad09.pdf
- Elm Debugger
- CiteSeerX — Induction of Recursive Program Schemes
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): . In this paper we present an approach to the induction of recursive structures from examples which is based on the notion of recursive program schemes. We separate induction from examples in two stages: (1) constructing initial programs from examples and (2) folding initial programs to recursive program schemes. By this separation, the induction of recursive program schemes can be reduced to a pattern-matching problem which can be handled by a generic algorithm. Construction of initial programs is performed with an approach to universal planning. "Background knowledge" is given in the form of operators and their conditions of application. Furthermore synthesizing recursive program schemes instead of programs in a predefined programming language enables us to combine program synthesis and analogical reasoning. A recursive program scheme represents the class of structural identical programs and can be assigned different semantics by interpretation. We believe that our appr...
- Solving Proportional Analogies by E–Generalization - Springer
- IMP programming language - Wikipedia, the free encyclopedia
- Gram–Schmidt process - Wikipedia, the free encyclopedia
- The Verasco static analyzer
- Table of Contents
- Project Euclid - mathematics and statistics online
- Fril - Wikipedia, the free encyclopedia
- [cs/0508091] Extending Prolog with Incomplete Fuzzy Information
- minesweeper.dvi - MinesweeperConstraints.pdf
- Absys - Wikipedia, the free encyclopedia
- floyd.pdf
- utah2000.pdf
- Yale FLINT Group: Publications
- Pragmatic-Thinking-Learning-Refactor-Programmers - 必应
- CiteSeerX — Citation Query Incremental LL(1) parsing in language-based editors
- CiteSeerX - Scientific documents that cite the following paper: Incremental LL(1) parsing in language-based editors
- Program Synthesis
- TS12.pdf
- OPM13EA.pdf
- XTL: eXtensible Typing Library
- Extending type systems in a library: Type-safe XML processing in C++ - XTL11.pdf
- gmain.dvi - lcpc05-paper-39.pdf
- main.dvi - SELLrationale.pdf
- Equal functions in ITT
- Polytely - Wikipedia, the free encyclopedia
- Generalized means-ends analysis and artificial intelligence
- English_MEA.ppt - English_MEA.ppt.pdf
- Artificial Intelligence II
- Artificial Intelligence II
- mitchfest-05-koutavas.pdf
- nuhosc.pdf
- lics04.dvi - nominalgames.pdf
- download
- Modal μ-calculus - Wikipedia, the free encyclopedia
- coq-linz.pdf
- paper5.pdf
- Gröbner basis - Wikipedia, the free encyclopedia
- Buchberger's algorithm - Wikipedia, the free encyclopedia
- a221571.pdf
- ValiantLearnable.pdf
- Learning intersections and thresholds of halfspaces - Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on - focs02-conf-version.pdf
- Learn chapel in Y Minutes
- Learn forth in Y Minutes
- Learn pogoscript in Y Minutes
- optRule.dvi - euroPar04.pdf
- Research papers/Compilation - HaskellWiki
- GHC/Using rules - HaskellWiki
- GHC optimisations - HaskellWiki
- Incremental computation with names
- download
- ECOOP 2011 | 25th European Conference on Object-Oriented Programming
- ProgrammingLanguageTheoryTextsOnline < Techno < UUCS
- Lambda the Ultimate object-functional
- Lambda the Ultimate oop
- Lambda the Ultimate Quotes
- Towards a Mathematical Science of Computation
- Towards a Mathematical Science of Computation
- Lambda the Ultimate teaching-learning
- Lambda the Ultimate Meta Programming
- Programming with Agents: Title Page: Michael Travers
- Usability Analysis of Visual Programming Environments : A ‘Cognitive Dimensions’ Framework - Green1996.pdf
- http://faculty.washington.edu/ajko/teaching/insc541/
- Archives: Lambda the Ultimate Weblogs
- McCarthy Formalism - Wikipedia, the free encyclopedia
- ocharles.hs
- Golan Levin: Software (as) art | TED Talk | TED.com
- Engineer and artist Golan Levin pushes the boundaries of what’s possible with audiovisuals and technology. In an amazing TED display, he shows two programs he wrote to perform his original compositions.
- C++17 progress update! (Oct 2015) : cpp
- The C++ Standardization Committee has finished another meeting! This was in Kona, Hawaii, at the same location as the first meeting I attended (in...
- Amber Smalltalk
- A Short History of Live Programming - Forward 3 Web Summit - YouTube
- Gilad Bracha, creator of the Newspeak programming language and engineer at Google: "The world is awakening to the joy of live programming tools. Where do the...
- GemTalk Systems
- Object Arts Home
- smalltalkrenaissance | The Reformation of Software Engineering
- The Reformation of Software Engineering
- Light Table
- Light Table is the next generation code editor. Light Table Connects you to your creation with instant feedback and showing data values flow through your code.
- The Galaxy Project: Online bioinformatics analysis for everyone
- Lively Kernel - Home
- andyfischer/circa
- circa - A programming language for live coding
- LIVE 2013: Workshop on Live Programming
- CRPIT 13:99 - Attack of the Clones
- Eff — a functional language with effect handlers
- A reflexive tactic for automated generation of proofs of incidence to an affine variety
- This paper describes the formalization and implementation of a reflexive tactic for automated generation of proofs of incidence to an affine variety. Incidence proofs occur frequently in formal proofs of geometric statements. Nevertheless they are most of the time omitted in pen-and-paper proofs since they do not contribute to the understanding of the proof in which they appear. Our tactic allows us to automate proofs about incidence to an affine variety. Being based on a type class capturing the minimal set of properties needed to deal with incidence, the tactic is applicable to any theory verifying these properties. This type class is defined using dependent types to formalize predicates of parameterizable arity which represent the incidence to an affine variety.
- burrito_monads.pdf
- EuLisp - Wikipedia, the free encyclopedia
- Genre Repertoire
- untitled - jucs_10_07_0751_0768_turner.pdf
- Semantics Engineering with PLT Redex: Preface
- Welcome to PLT Redex
- 1 Amb: A Redex Tutorial
- A Week with Elixir
- A Foundation for Embedded Languages
- A Foundation for Embedded Languages
- presentation.dvi - download
- The Slate Programming Language
- A dynamic prototype-based object-oriented programming language and environment with multiple dispatch and functional and reflective features.
- JoJo's Bizarre Adventure (novel) - JoJo's Bizarre Encyclopedia - Wikia
- JoJo's Bizarre Adventure (ジョジョの奇妙な冒険 JoJo no Kimyō na Bōken) is the first light novel released...
- jsnice15.pdf
- E.W. Dijkstra Archive: On the role of scientific thought (EWD447)
- Dijkstra's Rallying Cry for Generalization: the Advent of the Recursive Procedure, late 1950s - early 1960s | Dijkstra's Rallying Cry for Generalization
- Kristen Nygaard - Wikipedia, the free encyclopedia
- Rewriting techniques for program synthesis - Springer
- LEMMA: A system for automated synthesis of recursive programs in equational theories - Springer
- AutomaticInductiveSynthesis.pdf
- http://www.cs.bham.ac.uk/~udr/papers/synthesis.ps
- equational reasoning program synthesis - Google 搜索
- reference request - What was Hilbert's view of Goedel's Incompleteness Theorems? - MathOverflow
- PyPy Status Blog: Comparing Partial Evaluation and Tracing, Part 1
- PyPy Status Blog: A Simple Tracer for the Flow Graph Language
- The introduction to Reactive Programming you've been missing
- example/mario
- Welcome to Madoko
- 【板绘】不给糖就捣蛋~_东方吧_百度贴吧
- Fermat's Library | Recursive Functions of Symbolic Expressions and Their Computation by Machine annotated/explained version.
- "增值翻譯" 與 "譯者的自由"
- MQP_Budapest2015_FinalReport.pdf
- Simply Scheme: Introducing Computer Science ch 8: Higher-Order Functions
- The Jargon File
- A brief collection of Touhou ladies in fancy new dresses : touhou
- reddit: the front page of the internet
- COMP4161: Advanced Topics in Software Verification
- Thesis | Workshop on Realistic Program Verification
- A proof system for separation logic with magic wand
- CiteSeerX — A Theorem Prover for Boolean BI
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): While separation logic is acknowledged as an enabling technology for large-scale program verification, most of the existing verification tools use only a fragment of separation logic that excludes separating implication. As the first step towards a verification tool using full separation logic, we develop a nested sequent calculus for Boolean BI (Bunched Implications), the underlying theory of separation logic, as well as a theorem prover based on it. A salient feature of our nested sequent calculus is that its sequent may have not only smaller child sequents but also multiple parent sequents, thus producing a graph structure of sequents instead of a tree structure. Our theorem prover is based on backward search in a refinement of the nested sequent calculus in which weakening and contraction are built into all the inference rules. We explain the details of designing our theorem prover and provide empirical evidence of its practicality.
- Overview Logic Open Course
- ⚡Presentation "Intro to Hoare Type Theory Greg Morrisett. A pattern: Monads As in Haskell, distinguish purity with types: e : int –e is equivalent to an integer value."
- Intro to Hoare Type Theory Greg Morrisett. A pattern: Monads As in Haskell, distinguish purity with types: e : int –e is equivalent to an integer value.
- CiteSeerX — Dependent Types: Easy as PIE Work-In-Progress Project Description
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Dependent type systems allow for a rich set of program properties to be expressed and mechanically verified via type checking. However, despite their significant expressive power, dependent types have not yet advanced into mainstream programming languages. We believe the reason behind this omission is the large design space for dependently typed functional programming languages, and the consequent lack of experience in dependently-typed programming and language implementations. In this newly-started project, we lay out the design considerations for a general-purpose, effectful, functional, dependently-typed language, called PIE. The goal of this project is to promote dependently-typed programming to a mainstream practice. 1
- AIM-368.pdf
- contin.pdf
- James McKinna's Dutch Home Page
- Hilary Putnam - Wikipedia, the free encyclopedia
- Saul Kripke - Wikipedia, the free encyclopedia
- popl16-full.pdf
- blog 部落格
- Chenglong's Homepage
- Automatic Algorithm Invention with a GPU [28C3] - YouTube
- Automatic Algorithm Invention with a GPU Hell Yeah, it's rocket science You write software. You test software. You know how to tell if the software is workin...
- SubtypingTechReport.pdf
- C&C - Fixpoints and Iso-recursive Types
- AITP'16: 1st Conference on Artificial Intelligence and Theorem Proving
- Strange CoW Scans - Album on Imgur
- Images uploaded by XiraHunter
- Quantified Modal Logic - SEMANTIC QUBE propositional, modal and predicate logic
- Computing Modal Logic
- Program synthesis - Wikipedia, the free encyclopedia
- Zohar Manna's home page
- Home Page of Prof. Zohar Manna
- jfp05.pdf
- Pure subtype systems - hutchins2010.pdf
- Any interest for a Reddit bot tutorial? : learnprogramming
- Hey all, I wanted to know if you'd have any interest in seeing a tutorial or history of someone building a Reddit bot from scratch. I think that...
- Week 19-Does logic say we aren't computers? (Or, Gödelian arguments against mechanism) : philosophy
- ###Gödelian arguments against mechanism In this post I want to look a few of the arguments that people have given against mechanism that employ...
- Joe Duffy - Blogging about Midori
- Joe Duffy's Blog | Adventures in the high-tech underbelly
- Hints for computer system design
- history.pdf
- Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I
- Recursive Functions of Symbolic Expressions and
Their Computation by Machine, Part I
- A BASIS FOR A MATHEMATICAL THEORY OF COMPUTATION
- A BASIS FOR A MATHEMATICAL THEORY OF COMPUTATION
- The Original 'Lambda Papers' by Guy Steele and Gerald Sussman
- Online bibliography of Scheme research
- title.intro.contents - book.pdf
- AITR-474.pdf
- Jaron Lanier - Wikipedia, the free encyclopedia
- Joe Duffy - From Simple Annotations for Analysis to Effect Typing
- Joe Duffy's Blog | Adventures in the high-tech underbelly
- Joe Duffy - Imperative + Functional == :-)
- Joe Duffy's Blog | Adventures in the high-tech underbelly
- AnonOps • Hexchat Tutorial
- Tutorial on how to connect to AnonOps with Hexchat and the ability to use TOR to connect.
- () - 1201.4801.pdf
- Google Research Publication: Spanner
- liamoc.net - Write Your Compiler by Proving It Correct
- liamoc.net - Imperative Reasoning is Hard
- kernel_results.eps - asplos06.pdf
- Free and Freer Monads
- Low-brow explanation of free and freer monads and of the boilerplate they free us from
- Language, Philosophy of | Internet Encyclopedia of Philosophy
- Frege, Gottlob: Language | Internet Encyclopedia of Philosophy
- Haskell/Denotational semantics - Wikibooks, open books for an open world
- A++ [Eric Torreborre's Blog]: Strong functional programming
- van Dalen, D., 1994: Logic and Structure, 3rd augmented edition, Springer. - Bing
- Operational Semantics Using the Partiality Monad - danielsson-semantics-partiality-monad.pdf
- Operational Semantics Using the Partiality Monad - danielsson-semantics-partiality-monad-talk.pdf
- Program-ing Finger Trees in Coq - Program-ing_Finger_Trees_in_Coq.pdf
- Welcome to Less Wrong
- 东方同人音乐博物馆【红】【387P】(108)_音乐选集_音乐_bilibili_哔哩哔哩弹幕视频网
- 自制 封面画师推特id遗失
- CiteSeerX — Citation Query Modular proof systems for partial functions with Evans equality
- CiteSeerX - Scientific documents that cite the following paper: Modular proof systems for partial functions with Evans equality
- Modular Proof Systems for Partial Functions with Evans Equality (PDF Download Available)
- Official Full-Text Publication: Modular Proof Systems for Partial Functions with Evans Equality on ResearchGate, the professional network for scientists.
- computability - What functions can System F not compute? - Theoretical Computer Science Stack Exchange
- Towards a geometry of interaction - Towards a geometry of interaction.pdf
- Computational Thinking and Outreach
- Wadler: History of logic and programming languages
- "Strange Loops: Capturing Knots With Powerful Notations" by Kay Ye - YouTube
- Mathematician John Conway once boasted that one of his predecessors took six years to enumerate all 54 knots of a certain type, but that his own powerful not...
- Intersectional Types: a new mailing list for programming languages researchers and research-curious | Geek Feminism Blog
- This is a guest post by Chris Martens, a programming languages researcher who recently got her Ph.D. at Carnegie Mellon University; she research-blogs at lambdamaphone.blogspot.com. STEM academia falls behind the broader "women in tech" movements in several respects, most notably in the sense that we don't have many spaces (i.e. backchannels) to discuss, organize, and…
- The TYPES Forum
- The Book! | 2D Goggles
- Wadler: Blame and contracts
- Index of /wadler/topics
- CiteSeerX — Towards Fine-Grained Proof Planning with Critical Agents
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda):
- Cooperating Theorem Provers - Springer
- CiteSeerX — An Open Approach to Concurrent Theorem-Proving
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): The purpose of this paper is twofold. Its main aim is to present an alternative mechanism for representing concurrent theorem-proving activity which primarily relies upon massive parallelism and efficient broadcast communication. A secondary aim is to further motivate this model of concurrent theorem-proving by outlining how the basic model might be utilised in order to provide more dynamic, flexible and adaptable systems. The approach to concurrent theorem-proving we propose is based upon the use of asynchronously executing concurrent objects. Each object contains a particular set of formulae and broadcasts messages corresponding to specific information about those formulae. Based upon the messages that an object receives, it can make simple inferences, transforming the formulae it contains and sending out further messages as a result. Communication can be organised so that, if a formula, distributed across a set of objects, is unsatisfiable then at least one of the objects will event...
- multi agent proof planning - Bing
- multi agent programming - Bing
- http://www.padsproj.org/
- bidirectional programming - Bing
- Yoneda lemma - Wikipedia, the free encyclopedia
- Research Papers of Manuel Chakravarty
- Nattermorphisms: 2 Minute intro to Associated Types / Type Families
- Extraction in Coq: An Overview
- Authors: Pierre Letouzey. Citations: 7
- Program Extraction from Normalization Proofs
- Authors: Ulrich Berger, Stefan Berghofer, Pierre Letouzey, Helmut Schwichtenberg. Citations: 18
- A Large-Scale Experiment in Executing Extracted Programs
- Authors: Luís Cruz-filipe, Pierre Letouzey. Citations: 10
- Functors for Proofs and Programs
- Authors: Jean-christophe Filliâtre, Pierre Letouzey. Citations: 13
- Decidability and proof systems for language-based noninterference relations
- all.dvi - ts_read.pdf
- A Logic for Non-Terminating Golog Programs - KR08-058.pdf
- PII: S0743-1066(96)00121-5 - 1-s2.0-S0743106696001215-main.pdf
- Amazon.com: Zen and the Art of Motorcycle Maintenance: An Inquiry into Values (9780553277470): Robert M. Pirsig: Books
- Amazon.com: Zen and the Art of Motorcycle Maintenance: An Inquiry into Values (9780553277470): Robert M. Pirsig: Books
- A Pattern Language: Towns, Buildings, Construction (Center for Environmental Structure): Christopher Alexander, Sara Ishikawa, Murray Silverstein, Max Jacobson, Ingrid Fiksdahl-King, Shlomo Angel: 9780195019193: Amazon.com: Books
- A Pattern Language: Towns, Buildings, Construction (Center for Environmental Structure) [Christopher Alexander, Sara Ishikawa, Murray Silverstein, Max Jacobson, Ingrid Fiksdahl-King, Shlomo Angel] on Amazon.com. *FREE* shipping on qualifying offers. You can use this book to design a house for yourself with your family; you can use it to work with your neighbors to improve your town and neighborhood; you can use it to design an office
- User Interface Design for Programmers: Avram Joel Spolsky: 0689253159415: Amazon.com: Books
- User Interface Design for Programmers [Avram Joel Spolsky] on Amazon.com. *FREE* shipping on qualifying offers. Most programmers' fear of user interface (UI) programming comes from their fear of doing UI design. They think that UI design is like graphic design―the mysterious process by which creative
- Don't Make Me Think! A Common Sense Approach to Web Usability: Steve Krug, Roger Black: 9780789723109: Amazon.com: Books
- Don't Make Me Think! A Common Sense Approach to Web Usability [Steve Krug, Roger Black] on Amazon.com. *FREE* shipping on qualifying offers. <P>People won't use your web site if they can't find their way around it. Whether you call it usability, ease-of-use
- About Face: The Essentials of User Interface Design: Alan Cooper, Andrew Singer: 9781568843223: Amazon.com: Books
- About Face: The Essentials of User Interface Design [Alan Cooper, Andrew Singer] on Amazon.com. *FREE* shipping on qualifying offers. The cleverest code in the world is worth nothing if a program's interface proves an unwieldy barrier to users. That's why programmers and designers alike will benefit from About Face: The Essentials of User Interface Design. Here
- The Design of Everyday Things: Donald Norman: 9780385267748: Amazon.com: Books
- The Design of Everyday Things [Donald Norman] on Amazon.com. *FREE* shipping on qualifying offers. A popular, entertaining, and insightful analysis of why some products satisfy customers while others only frustrate them. B & W photographs and illustrations throughout.
- Amazon.com: The Non-Designer's Design Book: Design and Typographic Principles for the Visual Novice (0076092006329): Robin Williams: Books
- Amazon.com: The Non-Designer's Design Book: Design and Typographic Principles for the Visual Novice (0076092006329): Robin Williams: Books
- Amazon.com: Influence: The Psychology of Persuasion (9780688128166): Robert B. Cialdini: Books
- Amazon.com: Influence: The Psychology of Persuasion (9780688128166): Robert B. Cialdini: Books
- Helplessness: On Depression, Development, and Death (Series of Books in Psychology): Martin E. P. Seligman: 9780716723288: Amazon.com: Books
- Helplessness: On Depression, Development, and Death (Series of Books in Psychology) [Martin E. P. Seligman] on Amazon.com. *FREE* shipping on qualifying offers. This volume demonstrates how learned helplessness develops and operates, and how it can lead to depression, anxiety
- Peopleware: Productive Projects and Teams (Second Edition): Tom DeMarco, Timothy Lister: 9780932633439: Amazon.com: Books
- Peopleware: Productive Projects and Teams (Second Edition) [Tom DeMarco, Timothy Lister] on Amazon.com. *FREE* shipping on qualifying offers. Demarco and Lister demonstrate that the major issues of software development are human, not technical. Their answers aren't easy--just incredibly successful. New second edition features eight all-new chapters. Softcover. Previous edition: c1987. DLC: Management.
- First Introspection, 2010.12 | Self
- Introspection is Self observation, which makes sense because in the end computers are more about us than anything else. At the end of 2010, it is time to take stock of ourselves, considering what has been done (and not done) and prepare for the inevitably ignored New Year’s Resolutions. For those who have just arrived…
- The Smalltalk Revolution — Smalltalk Talk — Medium
- Birth of the Smalltalk Renaissance Program
- >H: My First Impressions of Smalltalk
- Smalltalk 80: The Interactive Programming Environment - Bing
- 1507.03559v1.pdf
- Deep into Pharo
- Deep into Pharo is the second volume of a series of books covering Pharo
- (Updated) Pharo by Example - UpdatedPharoByExample.pdf
- Stevey's Blog Rants
- PTTP - Prolog Technology Theorem Prover
- A simple and efficient incremental LL(1) parsing - Springer
- Principles of Programming Languages (PhD)
- Subtractive logic
- Baseline conditions and subtractive logic in neuroimaging. - PubMed - NCBI
- Hum Brain Mapp. 2001 Dec;14(4):228-35. Comparative Study; Research Support, Non-U.S. Gov't; Research Support, U.S. Gov't, P.H.S.
- tcs.dvi - tcs.pdf
- Polyglot extensible compiler framework
- Ward Cunningham - Do you get religious about programming languages? | TheChannel9Team | Channel 9
- Ward, inventor of the Wiki, says he's learned 100 programming languages, so we wondered if he feels particularly strongly about one of them over the others?
What's your favorite language? Did it
- abiall.dvi - abiall.pdf
- Java Is a Language for the Masses
- Analyze <code>this</code>!
- James Gosling talks with Bill Venners about his current research project, code-named Jackpot,
which builds annotated parse trees for programs and can analyze, help you visualize, and
refactor your program.
- LtU Classic Archives
- LtU Classic Archives
- GENETICA INFORMATICS
- Philip Greenspun's Weblog » 2003 » September » 22
- Language Log: Sapir/Whorf: sex (pro) and space (anti)
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- Universals and Particulars
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- Langsmith Languages
- LtU Classic Archives
- LtU Classic Archives
- OPS5 - Wikipedia, the free encyclopedia
- CLHS: Special Operator UNWIND-PROTECT
- 10.4 Continuations
- 2013-10-07: Saving State with Dynamic Wind
- Call With Current Continuation
- KMP's PFAQ: UNWIND-PROTECT vs Continuations (page 3)
- KMP's PFAQ: UNWIND-PROTECT vs Continuations (page 3)
- MIT Exokernel Operating System
- MIT Exokernel Theses
- Design Patterns as a statement of failure
- Welcome to lesscode.org
- The Ying and the Yang
- Guns, Germs, and Open Source
- More Developers, Less Code
- Code is Model
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- Abstract interpretation - Wikipedia, the free encyclopedia
- M.V.Wilkes-Tech.Memo.63.5.pdf
- M.V.Wilkes-Tech.Memo.63.1.pdf
- Pure and applied programming
- Computers then and now
- A Revisionist Account of Early Language Development
- Computing perspectives
- Empiric
- Constraint-type statements in programming languages
- Some Reflections on Static Programming under Uncertainty - Springer
- Coding at the Speed of Touch | Lambda the Ultimate
- ydtm.pdf
- 1312.6034v2.pdf
- 1506.02753.pdf
- 1412.1897v4.pdf
- jfp06.pdf
- ICFP2005.pdf
- Socio-PLT: Principles for Programming Language Adoption
- Leo A. Meyerovich explains how social adoption patterns can help language designers make new languages that are inherently attractive and desirable by developers.
- Social Influences on Language Adoption | Lambda the Ultimate
- The Emerald programming language
- Kappa calculus - Wikipedia, the free encyclopedia
- [1511.04179] Realisability semantics of abstract focussing, formalised
- Eric Walkingshaw - Human Factors in Programming Languages
- MatchingObjectsWithPatterns-TR.pdf
- John Gray: Steven Pinker is wrong about violence and war | Books | The Guardian
- A new orthodoxy, led by Steven Pinker, holds that war and violence in the developed world are declining. The stats are misleading, argues John Gray – and the idea of moral progress is wishful thinking and plain wrong
- elephants don't play chess - 必应
- Cargo-cult debugging - bitquabit
- 2004-02-16.pdf
- LtU Classic Archives
- kennedy-syme.pdf
- LtU Classic Archives
- tr93_32.pdf
- AI Series Publications Search
- The Icon Implementation Book
- LtU Classic Archives
- http://www.dcs.gla.ac.uk/~daw/publications/SEMISH.ps
- David Espinosa
- LtU Classic Archives
- Browse the Turing Digital Archive
- Browse the images of letters, papers and photos from the Turing Archive
- Jonathan Aldrich - Classic Papers
- lightweight-static-capabilities.pdf
- tse12-typestate.pdf
- Is it Pokemon or Big Data ?
- Is it Pokemon or Big Data ?
- Robert J. Simmons
- Socio-PLT.pdf
- 1202.0076v1.pdf
- Hatnote Listen to Wikipedia
- Listen to recent changes on Wikipedia
- Gregory Chaitin - Wikipedia, the free encyclopedia
- Book Review: Exploring Randomness and The Unknowable, Volume 48, Number 9 - rev-panu.pdf
- The Berry Paradox
- Life as Evolving Software | Undefined Terms
- Gregory Chaitin writes "For many years we have been disturbed by the fact that there is no fundamental mathematical theory inspired by Darwin’s theory of evolution". He goes on to say "In the first paper in this series we proposed modeling biological evolution by studying the evolution of randomly mutating software—we call this metabioliogy". Read…
- Is Chaitin proving Darwin with metabiology? | Theory, Evolution, and Games Group
- Algorithmic information theory (AIT) allows us to study the inherent structure of objects, and qualify some as 'random' without reference to a generating distribution. The theory originated when Ray Solomonoff (1960), Andrey Kolmogorov (1965), and Gregory Chaitin (1966) looked at probability, statistics, and information through the algorithmic lens. Now the theory has become a central…
- The Haskell Road to Logic, Maths and Programming
- Perl Contains the Lambda-Calculus
- Higher-Order Perl
- jse.pdf
- The Java Syntactic Extender
- Steelman
- Steelman, the requirements document for Ada
- SISCweb Overview
- Lemonodor: ILC 2005 Slides and Audio
- ESL Design | Lambda the Ultimate
- A Strongly Typed Functional Operating System Based on Dynamics
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- Scsh - The Scheme Shell
- LtU Classic Archives
- LtU Classic Archives
- Alice
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- Jeremy Gibbons' Publications
- fop.dvi - fop-conal.pdf
- main.dvi - popl.pdf
- TCD-CS-1999-74.pdf
- Simon Peyton Jones: papers
- Simon Peyton Jones: papers
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- Deriving backtracking monad transformers
- LtU Classic Archives
- Template metaprogramming for Haskell
- http://www.comsem.org/
- LtU Classic Archives
- AMPL | STREAMLINED MODELING FOR REAL OPTIMIZATION
- Impact of static type systems on productivity of actual programmers: first experiment I've seen documented. | Lambda the Ultimate
- Static vs. dynamic languages: a literature review
- We need talks on type theory for non-academics. With actual citations/evidence for what % bugs type systems prevent, or dev time they save — …
- http://www.cse.chalmers.se/~peterd/papers/inductive.html
- Second-order logic (explained in plain English) | John Corcoran - Academia.edu
- By John Corcoran in Logic And Foundations Of Mathematics and Teaching and Learning. “Second-order Logic” in Anderson, C.A. and Zeleny, M., Eds. Logic, Meaning, and Computation: Essays in Memory of Alonzo Church. Dordrecht: Kluwer, 2001. This
- Varieties of Logic - History and Philosophy of Logic -
- Formalizing 100 Theorems
- John Corcoran, second-order logic - PhilPapers
- “Second-order Logic” in Anderson, C.A. and Zeleny, M., Eds. Logic, Meaning, and Computation: Essays in Memory of Alonzo Church. Dordrecht: Kluwer, 2001. Pp. 61–76. Abstract. This expository article focuses on the ...
- ad: Automatic Differentiation | Hackage
- CiteSeerX — Citation Query An efficient incremental LR parser for grammars with epsilon productions
- CiteSeerX - Scientific documents that cite the following paper: An efficient incremental LR parser for grammars with epsilon productions
- Eliminating Work: Why prolog is by far the best, most productive, easiest programming language
- TyRuBa
- Answer set programming - Wikipedia, the free encyclopedia
- About SOUL » The SOUL program query language
- Cycorp: Home of Smarter Solutions | Knowledge modeling and machine reasoning environment capable of addressing the most challenging problems in industry, government, and academia
- Cycorp offers cutting edge innovations in knowledge representation, machine reasoning, natural language processing, semantic data integration, and information management and search.
- Capability Computation
- E: Cryptographic Capabilities for Distributed Smart Contracting
- Smart Contracts
- E: Cryptographic Capabilities for Distributed Smart Contracting
- Reactive Demand Programming
- Business System 12 (BS12)
- Object Oriented Systems Analysis: Modeling the World in Data: Sally Shlaer, Stephen J. Mellor: 9780136290230: Amazon.com: Books
- Object Oriented Systems Analysis: Modeling the World in Data [Sally Shlaer, Stephen J. Mellor] on Amazon.com. *FREE* shipping on qualifying offers. This book presents semantic modeling of data as a technique for systems analysis.
- H.S. Lahman on OO and MDA: 3.0 Normalization
- Previous post in category Class Models are based on the Relational Model portion of Set Theory. However, this is not the same as the Relational Data Model (RDM) that one sees applied in Data Models for relational databases. Unfortunately the...
- Structural insight
- http://www.jot.fm/issues/issue_2007_10/paper5/
- LtU Classic Archives
- PLDBProblem.pdf
- Out of the Tar Pit - tarpit.pdf
- fiat-to-facade.pdf
- R6RS Status Report
- LtU Classic Archives
- AITR-221.pdf
- Onward! 2012 : proceedings of the ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software : October 19-26, 2012, Tucson, Arizona, USA (eBook, 2012) [WorldCat.org]
- Get this from a library! Onward! 2012 : proceedings of the ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software : October 19-26, 2012, Tucson, Arizona, USA. [Gary T Leavens; ACM Special Interest Group on Programming Languages,; Microsoft Research,; Association for Computing Machinery,; ACM Digital Library.;]
- Alternative programming interfaces for alternative programmers
- SPLASH 2015
- General talks about Haskell
- thesis.pdf
- SQLOS - unleashed - Slava Oks's WebLog - Site Home - MSDN Blogs
- Reactive Demand Programming | Awelon Blue
- Posts about Reactive Demand Programming written by dmbarbour
- Stability and RDP | Awelon Blue
- Stability is a valuable property (or set of properties) for any system. For a quick background, I recommend you peruse the Wikipedia articles: metastability, superstabilization, dynamic algorithm, self-stabilization. Stability in different dimensions is discussed with a variety of different names: Stable functions - a small or continuous change in state or input has a corresponding…
- Generative Grammar-based Computation | Lambda the Ultimate
- Anticipation in RDP | Awelon Blue
- The ability to anticipate the future - even if only a small, fixed distance - is a valuable tool in reactive demand programming (RDP) that supports a variety of temporal requirements. Importantly, anticipate achieves these benefits without compromising valuable features of RDP such as eventual consistency or network resilience. anticipate :: (Signal s) => PosDiffTime…
- The SAFE Platform | Lambda the Ultimate
- Extensible Records With Scoped Labels | Lambda the Ultimate
- Morrow & First-class Labels | Lambda the Ultimate
- Gradual Typing for Objects | Lambda the Ultimate
- Program interpolation
- download
- The Sixth International Workshop on Automatic Performance Tuning
- A minimal template page to use with the Sinorcaish CSS stylesheet
- Shriram Krishnamurthi: Published Papers
- weimer-gecco2009-preprint.pdf
- Push, PushGP, and Pushpop
- popl90.pdf
- Off the Beaten Track: Underrepresented Problems for Programming Language Researchers
- The Feyerabend Project
- Writing a new language - ideas? | Lambda the Ultimate
- beyond multi-methods | Lambda the Ultimate
- The Theory and Calculus of Aliasing | Lambda the Ultimate
- A proof engine for Eiffel | Lambda the Ultimate
- A functional-programming view of time | Lambda the Ultimate
- What is the best system for experimenting with and visualizing complex algorithms? | Lambda the Ultimate
- Nomenclature for impure functions | Lambda the Ultimate
- Types from imported modules "leaking" into a module's public interface | Lambda the Ultimate
- Leveled Garbage Collection | Lambda the Ultimate
- Can contracts provide the features of type classes, bounded quantification and effect systems? | Lambda the Ultimate
- Programming and Scaling | Lambda the Ultimate
- Is it possible to write code that works the very first time? | Lambda the Ultimate
- The Last Language? | Lambda the Ultimate
- "Crutches in language design", accidental complexity and feature overlap | Lambda the Ultimate
- Extensible Programming with First-Class Cases | Lambda the Ultimate
- Is the Expression Problem Fundamental? | Lambda the Ultimate
- Sample applications for programming languages | Lambda the Ultimate
- FAQ | Bloom Programming Language
- Kaleidoscope (programming language) - Wikipedia, the free encyclopedia
- Dyalog - Mastering Dyalog APL by Bernard Legrand
- Rex Swain's APL Information
- APL Language, Organizations, Publications,
Vendors; STSC History, Alumni
- Interview [Video] -> Simon Peyton-Jones - Closer to Nirvana | Lambda the Ultimate
- Critical Programming Language Design | Lambda the Ultimate
- Classification of the principal programming paradigms
- The Ciao System
- Introduction — The Ciao Preprocessor
- Long rant on Erlang-style Actors: Lost Dimension | Lambda the Ultimate
- REPL-schmepl? | Lambda the Ultimate
- Feather: A Heapless Functional Programming Language | Lambda the Ultimate
- Higher order versus Object order | Lambda the Ultimate
- Why and How People Use R | Lambda the Ultimate
- On the Naturalness of Software | Lambda the Ultimate
- Symmetry in type systems | Lambda the Ultimate
- Research in Programming Languages | Lambda the Ultimate
- Quantitative comparison of unit testing vs. static typing? | Lambda the Ultimate
- Type classes in a dynamic language | Lambda the Ultimate
- Updating immutable data structures & hybrids from functional to imperative | Lambda the Ultimate
- Languages & Niches | Lambda the Ultimate
- Languages with 'unique' programs | Lambda the Ultimate
- Is this region typing, dependent types or something else? What do I need to be able to express this constraint? | Lambda the Ultimate
- Interactive Tutorial of the Sequent Calculus | Lambda the Ultimate
- Evolved Turing neural networks - Unorganized machines and the brain | Lambda the Ultimate
- Language Implementation 101 | Lambda the Ultimate
- Learnable Programming | Lambda the Ultimate
- Google's Dart announced | Lambda the Ultimate
- Five "laws" of programming paradigms | Lambda the Ultimate
- Typographical extensions for programming languages: breaking out of the ASCII straitjacket | Lambda the Ultimate
- The Sequential Semantics of Producer Effect Systems
- Workshop on Probabilistic Programming in December | Lambda the Ultimate
- Its type checking, Jim, but not as we know it. | Lambda the Ultimate
- Usable Live Programming | Lambda the Ultimate
- Strong Mathematical Foundations for Computer Science | Lambda the Ultimate
- Do Logic Languages Need Negation? | Lambda the Ultimate
- Rank-0 Intersection Type System | Lambda the Ultimate
- Those pesky higher-rank types. Or how to type \f x y. (f x, f y) | Lambda the Ultimate
- Automatically Deriving Mutable Data Structures? | Lambda the Ultimate
- From Programming Language Design (PLD) to Programmer Experience Design (PXD) | Lambda the Ultimate
- Divergence not bottom? | Lambda the Ultimate
- Whither Flow Analysis? | Lambda the Ultimate
- A sketch of a "design papers/pearls" category in academic conferences | Lambda the Ultimate
- 1ML — Core and modules united | Lambda the Ultimate
- Live programming in APX, an early peek | Lambda the Ultimate
- Aggregations (e.g., sets) in Logic Programs | Lambda the Ultimate
- Refactoring Functional Programs
- languagetypes - learnprogramming
- reddit: the front page of the internet
- “I Need Practice Programming”: 49 Ideas for Game Clones to Code | The “Invent with Python” Blog
- Nifty Assignments
- quick coding projects to keep you sharp
- reddit: the front page of the internet
- About - Project Euler
- A website dedicated to the fascinating world of mathematics and programming
- ROSALIND | Problems | Locations
- P-99: Ninety-Nine Prolog Problems
- L-99: Ninety-Nine Lisp Problems
- CodinGame - Programming is fun
- CodinGame is the gaming platform for programmers. Solve programming puzzles, improve your skills, share, have fun.
- Hai Dang
- () - icl.pdf
- [1503.08744] Propositional Calculus in Coq
- robjsoftware.org | A blog about software – researching it, developing it, and contemplating its future.
- A blog about software - researching it, developing it, and contemplating its future.
- A Growable Language Manifesto | robjsoftware.org
- Warning: this is by far the largest and most action-packed post I've ever made. Grab a cup of [insert favored beverage here], sit back, and enjoy. If you get headcramp from reading this in narrow-column blog format, there's another full-screen version here -- but please return to this post to leave your comments!I've posted recently…
- Scrap your boilerplate: a practical approach to generic programming
- A Certified Type-Preserving Compiler from Lambda Calculus to Assembly Language | Lambda the Ultimate
- paper.dvi - might2007lfa.pdf
- A survey and discussion of taming effects | Lambda the Ultimate
- pldi91.pdf
- seven-csf08-paper.pdf
- subasd.pdf
- Data structures in programming language with linear types - Theoretical Computer Science Stack Exchange
- CiteSeerX — Citation Query Dijkstra et al., “On-the-fly garbage collection: An exercise in cooperation
- CiteSeerX - Scientific documents that cite the following paper: Dijkstra et al., “On-the-fly garbage collection: An exercise in cooperation
- Non-blocking algorithm - Wikipedia, the free encyclopedia
- Meta Math! by Gregory Chaitin · OverDrive: eBooks, audiobooks and videos for libraries
- Gregory Chaitin, one of the world's foremost mathematicians, leads us on a spellbinding journey, illuminating the process by which he arrived at his groundbreaking theory.Chaitin's revolutionary discovery, the Omega number, is an exquisitely compl...
- LtU Classic Archives
- TPK Algorithm in Different Programming Languages
- Hacker's Delight
- A collection of programming tricks
at the bit level, including a superoptimizer program for RISC computers.
- Halting program density? | Lambda the Ultimate
- LtU Classic Archives
- Mathematics self-proves its own Consistency (contra Gödel et. al.) | Lambda the Ultimate
- Language inspired by Orwell set to fool hackers - smh.com.au
- Security problems will be shut out by a revolutionary approach to
computing, writes Tim Ebringer. - The Sydney Morning Herald
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- M-J. Dominus Perl Paraphernalia
- Loell - w3future.com
- lazy object evaluation little language
- Automatic Algorithm Recognition and Replacement: A New Approach to Program Optimization: Robert Metzger, Zhaofang Wen: 9780262133685: Amazon.com: Books
- Automatic Algorithm Recognition and Replacement: A New Approach to Program Optimization [Robert Metzger, Zhaofang Wen] on Amazon.com. *FREE* shipping on qualifying offers. <P>Parallel computation will become the norm in the coming decades. Unfortunately, advances in parallel hardware have far outpaced parallel applications of software. There are currently two approaches to applying parallelism to applications. One is to write completely new applications in new languages. But abandoning applications that work is unacceptable to most nonacademic users of high-performance computers. The other approach is to convert existing applications to a parallel form. This can be done manually or automatically. Even partial success in doing the job automatically has obvious economic advantages.This book describes a fundamentally new theoretical framework for finding poor algorithms in an application program and replacing them with ones that parallelize the code.</P>
- A_Unification_Algorithm_for_Coq_featuring_Universe_Polymorphism_and_Overloading-ICFP15.pdf
- dingjibang/GDX-RPG
- GDX-RPG - a Role Playing Game by java and LibGDX http://shadow.rpsg-team.com
- The RiSE of Research in Software Engineering | Peli at RiSE | Channel 9
- Wolfram Schulte introduces us to the Research in Software Engineering (RiSE) group.
The RiSE group will start publishing weekly videos on Channel9. The videos will not only describe tools or techno
- Boogie: An Intermediate Verification Language - Microsoft Research
- Boogie is an intermediate verification language, intended as a layer on which to build program verifiers for other languages. Several program verifiers have been built in this way, including one for the object-oriented .NET language Spec#, the HAVOC and vcc verifiers for C, the Dafny language and verifier, and the concurrent language Chalice. A previous version of the language was called BoogiePL; the new version of the language is Boogie 2.
- Gensokyo.org » Music Circles
- Guy Steele on Programming Languages
- Sun Fellow Guy Steele is interviewed by Floyd Marinescu, co-founder of InfoQ, and Bobby Norton of ThoughtWorks. Guy works for the Programming Language Research Group. The interview focuses on programming languages, the lessons to be learned from the past and what to expect from the future.
- Guy Steele on Language Design | Lambda the Ultimate
- On Ruby: Questions Five Ways - Overview
- Code Reading | Lambda the Ultimate
- blame-tr.pdf
- formlets-aplas.pdf
- SELFMAN Project - SELFMAN Wiki
- Crossing the Chasm - Wikipedia, the free encyclopedia
- thesis.dvi - raphthesis.pdf
- Robust Composition: Towards a Unified Approach to Access Control and Concurrency Control
- E: Cryptographic Capabilities for Distributed Smart Contracting
- A series about optimization : haskell
- I am running a series on simple performance optimization. As a teaser, I start with a very inefficient program and optimize it using very simple...
- Deriving Operational Semantics from Denotational Semantics for Verilog (PDF Download Available)
- Official Full-Text Publication: Deriving Operational Semantics from Denotational Semantics for Verilog on ResearchGate, the professional network for scientists.
- Semantic Derivation Verification - Flairs05-105.pdf
- Evolving a predator–prey ecosystem of mathematical expressions with grammatical evolution - Alfonseca - 2014 - Complexity - Wiley Online Library
- On understanding coinduction
- Here’s the basic story:
- Master Burner Climax - Moriya Shrine
- On the Strong Co–induction in Coq - Springer
- Perl 6 Is Fun « House Absolute(ly) Pointless
- Adrian Hilton's Home Page
- cubicaltt.pdf
- Cyril Cohen's Home Page
- Proofs and Types
- Decision Procedures -- An Algorithmic Point of View
- A Note on Forcing and Type Theory - IOS Press
- The goal of this note is to show the uniform continuity of definable
functional in intuitionistic type theory as an application of forcing with
dependent type theory.
- http://matej-kosik.github.io/www/doc/coq/hacking/getting_started.html
- main.pdf
- Frege's Theorem and Foundations for Arithmetic (Stanford Encyclopedia of Philosophy)
- Frege system - Wikipedia, the free encyclopedia
- The ProofPower Web Pages
- The Automath Archive
- The Automath Archive contains historical articles and other documentation concerning the Automath project, a project aimed at designing a language for expressing complete mathematical theories in such a way that a computer can verify the correctness.
- Automatic synthesis of typed Λ-programs on term algebras
- CiteSeerX — Proof assistants: History, ideas and future
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract. In this paper I will discuss the fundamental ideas behind proof assistants: What are they and what is a proof anyway? I give a short history of the main ideas, emphasizing the way they ensure the correctness of the mathematics formalized. I will also briefly discuss the places where proof assistants are used and how we envision their extended use in the future. While being an introduction into the world of proof assistants and the main issues behind them, this paper is also a position paper that pushes the further use of proof assistants. We believe that these systems will become the future of mathematics, where definitions, statements, computations and proofs are all available in a computerized form. An important application is and will be in computer supported modelling and verification of systems. But there is still a long road ahead and I will indicate what we believe is needed for the further proliferation of proof assistants. Keywords. mathematics. Proof assistant; verification; logic; software correctness; formalized 1.
- introduction_to_the_flyspeck_project.pdf
- 42 famous theorems in ProofPower
- The Top 100 Theorems in Isabelle
- The LEGO Proof Assistant
- download
- Higher-order logic - Wikipedia, the free encyclopedia
- Second-order logic - Wikipedia, the free encyclopedia
- IEEE Xplore Full-Text PDF:
- http://basics.sjtu.edu.cn/~chen/papers/3hal-fel.ps
- http://basics.sjtu.edu.cn/~chen/papers/subeptjlc.ps
- Pure Programming Language
- Design by contract - Wikipedia, the free encyclopedia
- Predicate transformer semantics - Wikipedia, the free encyclopedia
- Design By Contract
- Peter Dybjer (Chalmers University of Technology, Göteborg) on ResearchGate - Expertise: Theory of Computation, Programming Languages, Logic and Foundations of Mathematics
- Peter Dybjer of Chalmers University of Technology, Göteborg with expertise in Theory of Computation, Programming Languages, Logic and Foundations of Mathematics is on ResearchGate. Read 68 publications, and contact Peter Dybjer on ResearchGate, the professional network for scientists.
- Peter Dybjer - Publications
- ResearchGate is a network dedicated to science and research. Connect, collaborate and discover scientific publications, jobs and conferences. All for free.
- Operational Semantics Using the Partiality Monad
- Artificial Intelligence Programming (ebook) by Eugene Charniak | 9781317767985
- Buy, download and read Artificial Intelligence Programming ebook online in EPUB format for iPhone, iPad, Android, Computer and Mobile readers. Author: Eugene Charniak; Christopher K. Riesbeck; Drew V. McDermott; James R. Meehan. ISBN: 9781317767985. Publisher: Taylor and Francis. Artificial intelligence research has thrived in the years since this best-selling AI classic was first published. The revision encompasses these advances by adapting its coding to Common Lisp, the wel
- Deep Inference
- MilnerFeschrift.dvi - HolHistory.pdf
- esop08-hygiene.pdf
- NU PLT
- Baoh - Wikipedia, the free encyclopedia
- Memoizing a Monadic Mixin DSL. (PDF Download Available)
- Official Full-Text Publication: Memoizing a Monadic Mixin DSL. on ResearchGate, the professional network for scientists.
- qs-avg/monads.v at master · Eelis/qs-avg
- qs-avg - Proofs of Quicksort's average case complexity
- What if Current Foundations of Mathematics are Inconsistent? | IAS Video Lectures
- Univalent Foundations of Mathematics - Program Description | IAS School of Mathematics
- Overview of Univalent Foundations | IAS Video Lectures
- Will Computers Redefine the Roots of Math? | WIRED
- When a legendary mathematician found a mistake in his own work, he embarked on a computer-aided quest to eliminate human error. To succeed, he has to rewrite the century-old rules underlying all of mathematics.
- A new foundation for mathematics
- Proofs are the key method of mathematics. Until now, it has mainly been humans who have verified whether proofs are correct. This could change, says Russian mathematician Vladimir Voevodsky, who points to evidence that, in the near future, computers rather than humans could reliably verify whether a mathematical proof is correct.
- univalence axiom in nLab
- rnoti-p1164.pdf
- Abel, Fields and Turing Laureates Meet the Next Generation › Heidelberg Laureate Forum
- Home.
- The HoTT book | Mathematics and Computation
- carloangiuli.com/blog/ » Blog Archive » Homotopy Type Theory: Univalent Foundations of Mathematics
- Homological algebra - Wikipedia, the free encyclopedia
- Voevodsky.pdf
- Surely You Are Joking? | Gödel's Lost Letter and P=NP
- A new way to write mathematics Vladimir Voevodsky won the Fields Medal in 2002 for his work on homotopy theory of algebraic varieties. Using his pioneering methods he proved, among many other things, a deep conjecture of John Milnor, that had been open for decades. Today I want to talk about, no, rant about, a…
- Gödel's Lost Letter and P=NP | a personal view of the theory of computation
- a personal view of the theory of computation
- Barrington Gets Simple | Gödel's Lost Letter and P=NP
- On the power of bounded width computations David Barrington is famous for solving a long standing open problem. What I love about his result is that the problem was open for years, his solution is beautiful, and also that he surprised us. Most of us who had worked on the problem guessed the other way:…
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Tao
- Sheaf (mathematics) - Wikipedia, the free encyclopedia
- Andrew Appel - Wikipedia, the free encyclopedia
- Andrew Appel's Home Page
- Godel's Dialectica interpretation and its two-way stretch | Solomon Feferman - Academia.edu
- By Solomon Feferman.
- dialectica.pdf
- Tait’s computability method - Bing
- Blum's speedup theorem - Wikipedia, the free encyclopedia
- The Laws of Thought - Wikipedia, the free encyclopedia
- [1511.06410] Better Computer Go Player with Neural Network and Long-term Prediction
- Path induction again (sorry) · Issue #460 · HoTT/book
- A textbook on informal homotopy type theory
- CiteSeerX — Typed Self-Interpretation by Pattern Matching
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Self-interpreters can be roughly divided into two sorts: self-recognisers that recover the input program from a canonical representation, and self-enactors that execute the input program. Major progress for statically-typed languages was achieved in 2009 by Rendel, Ostermann, and Hofer who presented the first typed selfrecogniser that allows representations of different terms to have different types. A key feature of their type system is a type:type rule that renders the kind system of their language inconsistent. In this paper we present the first statically-typed language that not only allows representations of different terms to have different types, and supports a self-recogniser, but also supports a selfenactor. Our language is a factorisation calculus in the style of Jay and Given-Wilson, a combinatory calculus with a factorisation operator that is powerful enough to support the pattern-matching functions necessary for a self-interpreter. This allows us to avoid a type:type rule. Indeed, the types of System F are sufficient. We have implemented our approach and our experiments support the theory.
- arb10.pdf
- The Game Homepage
- This isn't any old webpage - it's The Game Homepage. Home to the best free games and a quirky community filled with misfits and genius level designers.
- Immanuel Kant: Metaphysics of Morals (excerpt, part 2)
- Zhaohui Luo's Home Page
- CHALUO-EACL-ANON.dvi - EACL14.pdf
- Intuitionistic Logic (Stanford Encyclopedia of Philosophy)
- Platonism in the Philosophy of Mathematics (Stanford Encyclopedia of Philosophy)
- Logicism and Neologicism (Stanford Encyclopedia of Philosophy)
- Philosophy of Mathematics (Stanford Encyclopedia of Philosophy)
- notes.pdf
- flocaml.mp4
- Kirbyparis.pdf
- MalteThesis.pdf
- Rationality as Conformity - Springer
- Tangent Developer Journal
- The Programming Language Wars
- Mechanized Semantic Library
- CICM 2016 - 9th Conference on Intelligent Computer Mathematics
- Conference on Intelligent Computer Mathematics 2016
- CICM 2015 - Conference on Intelligent Computer Mathematics
- Conference on Intelligent Computer Mathematics 2015
- On the (Alleged) Value of Proof for Assurance | Lambda the Ultimate
- What Makes Tom Hanks Look Like Tom Hanks
- Turing-Completeness Totally Free - Springer
- Microsoft Word - ConservativeLogic2.doc - ConservativeLogic.pdf
- CiteSeerX — Synthesis: An Efficient Implementation of Fundamental Operating System Services
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): This dissertation shows that operating systems can provide fundamental services an order of magnitude more efficiently than traditional implementations. It describes the implementation of a new operating system kernel, Synthesis, that achieves this level of performance. The Synthesis kernel combines several new techniques to provide high performance without sacrificing the expressive power or security of the system. The new ideas include: ffl Run-time code synthesis --- a systematic way of creating executable machine code at runtime to optimize frequently-used kernel routines --- queues, buffers, context switchers, interrupt handlers, and system call dispatchers --- for specific situations, greatly reducing their execution time. ffl Fine-grain scheduling --- a new process-scheduling technique based on the idea of feedback that performs frequent scheduling actions and policy adjustments (at submillisecond intervals) resulting in an adaptive, self-tuning system that can support real-ti...
- No Title
- Pushpin Computing
- Alistair.Cockburn.us | Characterizing people as non-linear, first-order components in software development
- wcf.pdf
- Predicate dispatching: A unified theory of dispatch
- The lessons of Ariane
- Home page for object technology, Eiffel, software reuse, components, O-O training and consulting, with extensive online documentation,tutorials, articles and manuals.
- From Patterns to Components - Karine Arnout
- COMP 607
- Ludwig Wittgenstein - Wikipedia, the free encyclopedia
- PRL Project - Knowledge Base
- implementing computational mathematics and providing logic-based tools that help automate programming
- Books
- Chapters in Books
- Journal Articles
- Conference Proceedings
- Technical Reports
- mj-final.dvi - mj.pdf
- yesno: A Languagus for the Restivus
- A Programming Language
- Fritz Ruehr's home page
- doc.dvi - toplas95-po.pdf
- Flow Caml
- DSpace@MIT: The Art of the Propagator
- Bartosz Milewski's Programming Cafe | Concurrency, C++, Haskell, Category Theory
- Concurrency, C++, Haskell, Category Theory (by Bartosz Milewski)
- [cs/0507045] In the beginning was game semantics
- [math/0506553] Introduction to Cirquent Calculus and Abstract Resource Semantics
- Alessio Guglielmi's Research and Teaching
- Deep Inference
- ISO/IEC 8652:2012 - Information technology -- Programming languages -- Ada
- WG9 N451, Minutes, Meeting #48 of ISO/IEC JTC1/SC22/WG9, Friday, 24 June 2005, York, UK
- paper.pdf
- COMS E6998: Machine Learning for Natural Language Processing
- COMS W4705: Natural Language Processing (Spring 2015)
- Stanford University CS224d: Deep Learning for Natural Language Processing
- padl2003.pdf
- 如何学习自然语言处理 | 我爱自然语言处理
- LtU Classic Archives
- dual-reloaded.pdf
- λμ-Calculus: An algorithmic interpretation of classical natural deduction - parigot.pdf
- λμ-Calculus: An algorithmic interpretation of classical natural deduction - Springer
- Lambda-mu calculus - Wikiwand
- In mathematical logic and computer science, the lambda-mu calculus is an extension of the lambda calculus, and was introduced by M. Parigot.[1] It introduces two new operators: the mu operator and the bracket operator. Proof-theoretically, it provides a well-behaved formulation of classical natural deduction.
- Notes on Parigot’s Paper Introducing the Lambda-Mu-Calculus | Metatheorem
- Parigot defined the $latex \lambda\mu$-calculus in his paper "The $latex \lambda\mu$-Calculus: An Algorithmic Interpretation of Classical Natural Deduction"[4]. In this paper he gives several examples using the typed version of the $latex \lambda\mu$-calculus. The topic of this post is to first define and discuss Parigot's initial version of the typed $latex \lambda\mu$-calculus and complete these…
- Research in Programming Languages | Tagide
- trc.dvi - danvy-filinski-mscs92.pdf
- Untangling the Tale of Ada Lovelace—Stephen Wolfram Blog
- Stephen Wolfram shares what he learned in researching Ada Lovelace’s life, writings about the Analytical Engine, and computation of Bernoulli numbers.
- Michael Hicks
- Concepts, Techniques, and Models of Computer Programming
- A comprehensive programming textbook that
covers all important programming paradigms in a unified framework
that is both practical and theoretically sound.
Special attention is given to concurrent programming and data abstraction.
The textbook uses the Oz multiparadigm programming language for its examples.
- Shapes OO example: Haskell Code
- Adaptive Programming
- Retrospective: An Axiomatic Basis for Computer Programming | October 2009 | Communications of the ACM
- clause-learing 结构化表达之一 | neutronest
- 关于Clause learning | neutronest
- FOPwOA.pdf
- Object Algebras | Lambda the Ultimate
- Inductive Proof Automation for Coq (PDF Download Available)
- Official Full-Text Publication: Inductive Proof Automation for Coq on ResearchGate, the professional network for scientists.
- CiteSeerX — Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): We construct a hierarchy of semantics by successive abstract interpretations. Starting from the maximal trace semantics of a transition system, we derive the big-step semantics, termination and nontermination semantics, Plotkin’s natural, Smyth’s demoniac and Hoare’s angelic relational semantics and equivalent nondeterministic denotational semantics (with alternative powerdomains to the Egli-Milner and Smyth constructions), D. Scott’s deterministic denotational semantics, the generalized and Dijkstra’s conservative/liberal predicate transformer semantics, the generalized/total and Hoare’s partial correctness axiomatic semantics and the corresponding proof methods. All the semantics are presented in a uniform fixpoint form and the correspondences between these semantics are established through composable Galois connections, each semantics being formally calculated by abstract interpretation of a more concrete one using Kleene and/or Tarski
- BoyerMoore.pdf
- Nqthm, the Boyer-Moore prover
- The Boyer-Moore Theorem Prover
- Tac
- Rippling - Wikipedia, the free encyclopedia
- Integrating Implicit Induction Proofs into Certified Proof Environments
- Integrating Implicit Induction Proofs into Certified Proof Environments on ResearchGate, the professional network for scientists.
- Monotonicity Reasoning in Formal Semantics Based on Modern Type Theories (PDF Download Available)
- Official Full-Text Publication: Monotonicity Reasoning in Formal Semantics Based on Modern Type Theories on ResearchGate, the professional network for scientists.
- LiLiTR.pdf
- Mechanizing Structural Induction
- Embedding Dynamic Dataflow in a Call-by-Value Language
- Axiom Computer Algebra System
- 回复:【板绘】黄色花海里的恋恋ww_东方吧_百度贴吧
- Generalising Techniques for Type Debugging (PDF Download Available)
- Official Full-Text Publication: Generalising Techniques for Type Debugging on ResearchGate, the professional network for scientists.
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- What Numbers Could Not Be
- Authors: P. Benacerraf. Citations: 118
- ITP 2010 Home Page
- Paul Benacerraf - Wikipedia, the free encyclopedia
- In the Land of Invented Languages by Arika Okrent
- The history of invented languages - Failure magazine
- For every invented language you might have heard of, there are hundreds of others that have never been spoken by anyone—and never will.
- The New Coq Benchmarks
- The New Coq Benchmarks
- The New Coq Benchmarks
- The New Coq Benchmarks
- The New Coq Benchmarks
- ACM Classic Books Series
- [1203.4912] A survey of proof nets and matrices for substructural logics
- simonet-pottier-hmg.pdf
- CiteSeerX — Automating the Meta Theory of Deductive Systems
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): not be interpreted as representing the o cial policies, either expressed or implied, of NSF or the U.S. Government. This thesis describes the design of a meta-logical framework that supports the representation and veri cation of deductive systems, its implementation as an automated theorem prover, and experimental results related to the areas of programming languages, type theory, and logics. Design: The meta-logical framework extends the logical framework LF [HHP93] by a meta-logic M + 2. This design is novel and unique since it allows higher-order encodings of deductive systems and induction principles to coexist. On the one hand, higher-order representation techniques lead to concise and direct encodings of programming languages and logic calculi. Inductive de nitions on the other hand allow the formalization of properties about deductive systems, such as the proof that an operational semantics preserves types or the proof that a logic is is a proof calculus whose proof terms are recursive functions that may be consistent.M +
- Kartik Agaram
- Usable Live Programming - Microsoft Research
- A History of Mathematics, Second Edition: Carl B. Boyer, Uta C. Merzbach, Isaac Asimov: 9780471543978: Amazon.com: Books
- A History of Mathematics, Second Edition [Carl B. Boyer, Uta C. Merzbach, Isaac Asimov] on Amazon.com. *FREE* shipping on qualifying offers. Boyer and Merzbach distill thousands of years of mathematics into this fascinating chronicle. From the Greeks to Godel
- User Interface Design for Programmers: Avram Joel Spolsky: 0689253159415: Amazon.com: Books
- User Interface Design for Programmers [Avram Joel Spolsky] on Amazon.com. *FREE* shipping on qualifying offers. Most programmers' fear of user interface (UI) programming comes from their fear of doing UI design. They think that UI design is like graphic design―the mysterious process by which creative
- Re: How to Design (Declarative) Programming Languages
- Wadler's Blog: Howard on Curry-Howard
- History of Programming Languages
- Multics PL/I
- Use of the PL/I language in the Multics operating system.
- LtU Classic Archives
- LtU Classic Archives
- Worse Is Better
- Parametric Higher-Order Abstract Syntax for Mechanized Semantics
- Ott
- Ott tool
- An argument against call/cc
- Why a programming language should not offer a primitive to capture undelimited continuations (call/cc).
- Reflection Into Models of Finite Decidable FP-sketches in an Arithmetic Universe
- An Approach to Persistent Programming - ABC+83a.pdf
- Display calculi and other modal calculi: a comparison on JSTOR
- In this paper we introduce and compare four different syntactic methods for generating sequent calculi for the main systems of modal logic: the multiple sequent...
- Hypersequent and Display Calculi – a Unified Perspective (PDF Download Available)
- Official Full-Text Publication: Hypersequent and Display Calculi – a Unified Perspective on ResearchGate, the professional network for scientists.
- CiteSeerX — Nested Sequent Calculi and Theorem Proving for Normal Conditional Logics
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract. In this paper we focus on proof methods and theorem proving for normal conditional logics, by describing nested sequent calculi as well as a theorem prover for them. Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are allowed to occur within sequents. Nested sequent calculi have been profitably employed in the area of (multi)-modal logic to obtain analytic and modular proof systems for these logics. In this work, we describe nested sequent calculi recently introduced for the basic conditional logic CK and some of its significant extensions. We also provide a calculus for Kraus Lehman Magidor cumulative logic C. The calculi are internal (a sequent can be directly translated into a formula), cut-free and analytic. Moreover, they can be used to design (sometimes optimal) decision procedures for the respective logics, and to obtain complexity upper bounds. Our calculi are an argument in favour of nested sequent calculi for modal logics and alike, showing their versatility and power. We also describe NESCOND, a Prolog implementation of nested sequent calculi mentioned above. NESCOND (NESted sequent calculi for propositional CONDitional logics) is inspired by the methodolody of leanT A P. The paper also shows some experimental results, witnessing that the performances of NESCOND are promising. NESCOND is available at
- "Principia Narcissus: How to avoid being caught by your reflection" by Geoffrey Alan Washburn
- Some modern, statically typed programming languages provide the capability for programs to reflect, or introspect, upon their type meta-data at runtime. Using type meta-data to determine program behavior is called type-directed programming (TDP). Type-directed programming allows many operations on data, such as serialization, cloning, structural equality, and general iteration, to be defined naturally, just once, for all types of data. Consequently, these operations continue to work as systems grow and software is extended with additional data types. Without TDP, programmers must constantly revise the code that implements these operations and scatter their implementations throughout their code-base.^ However, TDP conflicts with the use of abstract data types (ADTS), a fundamental technique in the practice of software engineering. The benefits of using ADTS derive from the fact that their definitions are hidden; however, with TDP, abstract type meta-data becomes no more hidden than abstracted values (often called variables) in standard programming.^ In this dissertation, I show how TDP and ADTS can be reconciled through the use of information-flow type and kind systems. I begin by introducing the problem as well as my definitions for the properties I call confidentiality and integrity. Next, I develop the theoretical foundation for reasoning statically about confidentiality and integrity in programs that use TDP, and show how information-flow type and kind systems generalize prior techniques. I then describe a realistic programming language, InforML, with an information-flow type and kind system. After introducing the InforML language, I describe idioms for programming in InforML and the reasoning principles for confidentiality and integrity that are a consequence of using these idioms. Finally, I discuss the implementation of InforML and the most important design decisions made while implementing InforML. ^
- COMBINING PROOFS AND PROGRAMS - casinghino-thesis.pdf
- Verifying Higher-order Programs with the Dijkstra Monad
- Haskell has no state monad : haskell
- reddit: the front page of the internet
- Mathematical Components
- math-comp/ChangeLog at master · math-comp/math-comp
- math-comp - Mathematical Components
- Notes on the Oxford IUT workshop by Brian Conrad | mathbabe
- Brian Conrad is a math professor at Stanford and was one of the participants at the Oxford workshop on Mochizuki’s work on the ABC Conjecture. He is an expert in arithmetic geometry, a subfield of number theory which provides geometric formulations of the ABC Conjecture (the viewpoint studied in Mochizuki’s work). Since he was asked…
- esop12.pdf
- Control.Arrow
- shiffman/The-Nature-of-Code
- The-Nature-of-Code - Repository for The Nature of Code book
- Algebra: Chapter 0 (Graduate Studies in Mathematics): Paolo Aluffi: 9780821847817: Amazon.com: Books
- Algebra: Chapter 0 (Graduate Studies in Mathematics) [Paolo Aluffi] on Amazon.com. *FREE* shipping on qualifying offers. Algebra: Chapter 0 is a self-contained introduction to the main topics of algebra, suitable for a first sequence on the subject at the beginning graduate or upper undergraduate level. The primary distinguishing feature of the book
- nick athanasiou | CODEine
- Read all of the posts by nick athanasiou on CODEine
- Von Neumann–Bernays–Gödel set theory - Wikipedia, the free encyclopedia
- Dependent typing in C++
- Adventures in C++ and programming
- Zero-knowledge proof - Wikipedia, the free encyclopedia
- Donald E. Knuth Lectures | Stanford Center for Professional Development
- The Stanford Center for Professional Development has digitized more than one hundred tapes of Knuth's musings, lectures, and selected classes and posted them online. These archived tapes resonate with not only his thoughts, but with insights from students, audience members, and other luminaries in mathematics and computer science. They are available to the public free of charge. Knuth's impact is far-reaching. Literate programming, attributed to Knuth, essentially holds that computer programs should be developed with an eye toward human comprehension more than computer readability.
- jfp01.dvi - johann03.pdf
- [0904.3036] Inconsistency Robustness in Logic Programs
- Feldspar
- Everything old is new again: Quoted Domain Specific Languages - oldnew.pdf
- Logic and Computation: Interactive Proof with Cambridge LCF (Cambridge Tracts in Theoretical Computer Science): Lawrence C. Paulson: 9780521346320: Amazon.com: Books
- Logic and Computation: Interactive Proof with Cambridge LCF (Cambridge Tracts in Theoretical Computer Science) [Lawrence C. Paulson] on Amazon.com. *FREE* shipping on qualifying offers. Logic and Computation is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines methods of mathematical logic with domain theory
- JIT编译,动态编译与自适应动态编译 - 编程语言与高级语言虚拟机杂谈(仮) - 知乎专栏
- 知乎专栏
- [math/0212377] Objects of Categories as Complex Numbers
- 关于正确处理人民内部矛盾的问题 - Bing
- while (“im automaton”);
- ASC
- Embedded in Academia :
- wingolog
- Joe Duffy - Safe Native Code
- Joe Duffy's Blog | Adventures in the high-tech underbelly
- Home - LSS - ANU
- Logic Summer School
- The Racket Manifesto
- Richard Jones' Garbage Collection Page
- The Garbage Collection page: links to
reference material, mailing list and implementations
- Wadler: Monads
- malias.pdf
- icfp76-swamy.dvi - monadic.pdf
- 函数式语言的编译优化 - Continuation - 知乎专栏
- 知乎专栏
- Categories for Software Engineering: Amazon.co.uk: Jose Luiz Fiadeiro: 9783540373469: Books
- Buy Categories for Software Engineering by Jose Luiz Fiadeiro (ISBN: 9783540373469) from Amazon's Book Store. Free UK delivery on eligible orders.
- 【回归开巨坑】听觉之旅:东方电子舞曲社团介绍_东方吧_百度贴吧
- ComicMarket89东方同人音乐资讯情报一览_东方吧_百度贴吧
- Home page for José Luiz Fiadeiro
- Home Page for José Luiz Fiadeiro
- Impact of OO language style on code | Lambda the Ultimate
- Neil Mitchell - Safe
- Front: [arXiv:1103.2841] Functor is to Lens as Applicative is to Biplate: Introducing Multiplate
- MathScheme-Home
- multiplate: Lightweight generic library for mutually recursive data types. | Hackage
- Intuitionistic Logic according to Dijkstra's Calculus of Equational Deduction. (PDF Download Available)
- Official Full-Text Publication: Intuitionistic Logic according to Dijkstra's Calculus of Equational Deduction. on ResearchGate, the professional network for scientists.
- conduit_v17n2.pdf - conduit_v17n2.pdf
- JOT: Journal of Object Technology - Theory of Classification
- What is the difference between a type and a class? What do we mean by plug-in compatibility? What is the difference between sub-typing and sub-classing? Can we explain inheritance, method combination and template instantiation?
- http://www.jot.fm/issues/issue_2004_05/column2/
- The Journal of Object Technology
- Journal of Object Technology
- JOT — Contents
- Journal of Object Technology
- LtU Classic Archives
- The Pernicious Influence of Mathematics upon Philosophy on JSTOR
- We shall argue that the attempt carried out by certain philosophers in this century to parrot the language, the method, and the results of mathematics has harme...
- Conduit Spring-Summer 2010.pdf - conduit_v19n1.pdf
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- LtU Classic Archives
- eros.pdf
- Tangible Value - HaskellWiki
- DeepArrow - HaskellWiki
- 【视频】魔理沙精选合集···安利向_雾雨魔理沙吧_百度贴吧
- Web Home (Events/PLATEAU) | ECS | Victoria University of Wellington
- 【東方】 ZYTOKINE 『Raising False Hopes』 - YouTube
- Vocal: cold kiss Arranger: Linjin Album: >>>> Titulo: Raising False Hopes Circulo: ZYTOKINE Tema Original: 亡失のエモーション (The Lost Emotion) del Touhou Shinkirou ...
- 【東方】 ZYTOKINE - KEEP THE MEMORY ALIVE - YouTube
- Title: KEEP THE MEMORY ALIVE Original: 幽雅に咲かせ、墨染の桜 ~ Border of Life (Bloom Nobly, Ink-Black Cherry Blossoms ~ Border of Life) Circle: ZYTOKINE Album: THE LEA...
- [1211.5762] Classical lambda calculus in modern dress
- TLA+ Proof System
- Steven Landsburg | The Big Questions: Tackling the Problems of Philosophy with Ideas from Mathematics, Economics, and Physics
- IEEE Xplore Book Home Page - Generating Language-Based Environments
- Amazon.com: Human Problem Solving (9780134454030): Allen Newell: Books
- Amazon.com: Human Problem Solving (9780134454030): Allen Newell: Books
- Redex: Practical Semantics Engineering
- THE multiprogramming system - Wikipedia, the free encyclopedia
- Semantic Domain: From DPLL(T) to Sequent Calculus
- 东方乐祭 Global2015 Comicup Special - 网易云音乐
- 网易云音乐是一款专注于发现与分享的音乐产品,依托专业音乐人、DJ、好友推荐及社交功能,为用户打造全新的音乐生活。
- C89东方同人本预览_东方吧_百度贴吧
- Neural Turing Machines – when trees fall…
- Content filed under the Neural Turing Machines category.
- All About Monads - HaskellWiki
- All About Monads - HaskellWiki
- All About Monads - HaskellWiki
- All About Monads - HaskellWiki
- All About Monads - HaskellWiki
- All About Monads - HaskellWiki
- All About Monads - HaskellWiki
- Cybele
- Coq plugin to use Coq as a tactic language for Coq.
- BCPL - Wikipedia, the free encyclopedia
- Smalltalk - Wikipedia, the free encyclopedia
- Dialogue Abstraction › Cycle.js
- A fully reactive JavaScript framework for Human-Computer Interaction
- H-99: Ninety-Nine Haskell Problems - HaskellWiki
- Eliezer_Yudkowsky comments on Prisoner's Dilemma Tournament Results - Less Wrong
- About two weeks ago I announced an open competition for LessWrong readers inspired by Robert Axelrod's famous tournaments. The competitors had to submit a strat
- AI cooperation is already studied in academia as "program equilibrium" - Less Wrong
- About a month ago I accidentally found out that the LW idea of quining cooperation is already studied in academia:
1) Moshe Tennenholtz's 2004 paper Program Equ
- Typeclasses vs The World.pdf - Google 云端硬盘
- A History of Haskell
- Wadler: Type classes
- General talks about Haskell
- CiteSeerX — Implicit Parameters: Dynamic Scoping with Static Types
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): This paper introduces a language feature, called implicit parameters, that provides dynamically scoped variables within a statically-typed Hindley-Milner framework. Implicit parameters are lexically distinct from regular identi ers, and are bound by a special with construct whose scope is dynamic, rather than static as with let. Implicit parameters are treated by the type system as parameters that are not explicitly declared, but are inferred from their use. We present implicit parameters within a small call-by-name -calculus. We give a type system, a type inference algorithm, and several semantics. We also explore implicit parameters in the wider settings of call-by-need languages with overloading, and call-by-value languages with eects. As a witness to the former, we have implemented implicit parameters as an extension of Haskell within the Hugs interpreter, which we use to present several motivating examples. 1 A Scenario: Pretty Printing You have just nished writing the perfe...
- Research Papers of Manuel Chakravarty
- Backpack: Retrofitting Haskell with Interfaces
- The Racket Guide
- The RTA list of open problems
- 《Principles of Program Analysis》补完计划 3.33 Constraint-Based k-CFA - System Fp - 知乎专栏
- 知乎专栏
- ZEN PENCILS » 76. NEIL ARMSTRONG: A giant among men
- SHErrLoc Project
- http://www.cs.cornell.edu/andru/papers/diagnostic/
- Zvonimir Pavlinovic
- SSA-based Compiler Design - book.pdf
- Principal variation search - Wikipedia, the free encyclopedia
- Computer Chess Programming Theory
- basics of strategy game programming: part II
- Programming Language Pragmatics, Third Edition: Michael L. Scott: 9780123745149: Amazon.com: Books
- Programming Language Pragmatics, Third Edition [Michael L. Scott] on Amazon.com. *FREE* shipping on qualifying offers. Programming Language Pragmatics</i> is the most comprehensive programming language textbook available today. Taking the perspective that language design and language implementation are tightly interconnected
- Nu-Prolog_Manual.pdf
- The Stanford Heuristic Programming Project: Goals and Activities | Buchanan | AI Magazine
- The Stanford Heuristic Programming Project: Goals and Activities
- Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project - Buchanan45.pdf
- Relational Programming in miniKanren: Techniques, Applications, and Implementations - Byrd_indiana_0093A_10344.pdf
- HemannMuKanren2013.pdf
- 《临界:智能的设计原则》目录和内容提要(购买链接更新) - 生命的设计原则 - 知乎专栏
- 知乎专栏
- p58-henzinger.tif - lazy.pdf
- Microsoft PowerPoint - TMS Intro [Compatibility Mode] - TMS Intro.pdf
- Problem Solving and Truth Maintenance Systems
- Rdgs-NW-Doyle.pdf
- Logic and Artificial Intelligence (Stanford Encyclopedia of Philosophy)
- Defeasible reasoning - Wikipedia, the free encyclopedia
- Abstract Interpretation of Constructive Type Theory | Simon Thompson - Academia.edu
- By Simon Thompson. Constructive type theories, such as that of Martin-Lof, allow program construction and verification to take place within a single system: proofs may be read as programs and propositions as types. However, parts of proofs may be
- Programming with Higher-Order Logic: Dale Miller, Gopalan Nadathur: 9781139021326: Amazon.com: Books
- Programming with Higher-Order Logic [Dale Miller, Gopalan Nadathur] on Amazon.com. *FREE* shipping on qualifying offers. Formal systems that describe computations over syntactic structures occur frequently in computer science. Logic programming provides a natural framework for encoding and animating such systems. However
- lpnmr13.pdf
- lp.pdf
- Lolli: A Linear Logic Programming Language
- TOC of Theorem List - Metamath Proof Explorer
- Ordinal analysis - Wikipedia, the free encyclopedia
- Peter Naur - Programming as Theory Building — Departamento de Computación
- Douglas Engelbart - Wikipedia, the free encyclopedia
- Dynamic knowledge repository - Wikipedia, the free encyclopedia
- Global brain - Wikipedia, the free encyclopedia
- Solomonoff's theory of inductive inference - Wikipedia, the free encyclopedia
- Alistair.Cockburn.us | ASD book extract: "Naur, Ehn, Musashi"
- Naur’s “Programming as Theory Building” | Catenary
- A critique from Alistair Cockburn on how the agile movement is under attack from Taylorism led me to an essay by Dave West on the philosophical incompatibilities between lean and agile techniques, and this in turn led me to finally give a read to Peter Naur's 1985 text, "Programming as Theory Building." (Also available in…
- Wadler: Functional Programming
- A Synapse-State Theory of Mental Life - synapse-state.pdf
- Knowing and the Mystique of Logic and Rules: including True Statements in ... - P. Naur - Google 图书
- Human knowing is examined as it emerges from classical empirical psychology, with its ramifications into language, computing, science, and scholarship. While the discussion takes empirical support from a wide range, claims for the significance of logic and rules are challenged throughout. Highlights of the discussion: knowing is a matter of habits or dispositions that guide the person's stream of consciousness; rules of language have no significance in language production and understanding, being descriptions of linguistic styles; statements that may be true or false enter into ordinary linguistic activity, not as elements of messages, but merely as summaries of situations, with a view to action; in computer programming the significance of logic, proof, and formalized description, is incidental and subject to the programmer's personality; analysis of computer modelling of the mental activity shows that in describing human knowing the computer is irrelevant; in accounting for the scholarly/scientific activity, logic and rules are impotent; a novel theory: scholarship and science have coherent descriptions as their core. The discussion addresses questions that are basic to advanced applications of computers and to students of language and science.
- CiteSeerX — Citation Query Go To Statements and Good ALGOL
- CiteSeerX - Scientific documents that cite the following paper: Go To Statements and Good ALGOL
- Improving the world's most popular functional language: user-defined functions in Exceln
- SSS* - Wikipedia, the free encyclopedia
- chessprogramming - Aspiration Windows
- MTD-f - Wikipedia, the free encyclopedia
- D* - Wikipedia, the free encyclopedia
- Jump point search - Wikipedia, the free encyclopedia
- SMA* - Wikipedia, the free encyclopedia
- B* - Wikipedia, the free encyclopedia
- Branch and bound - Wikipedia, the free encyclopedia
- Minimax - Wikipedia, the free encyclopedia
- When Wizards Stay Up Late - Bing
- The Idea Factory, Bell Labs and the great age of american innovation - Bing
- Book of Proof: Richard Hammack: 9780989472104: Amazon.com: Books
- Book of Proof [Richard Hammack] on Amazon.com. *FREE* shipping on qualifying offers. This book is an introduction to the language and standard proof methods of mathematics. It is a bridge from the computational courses (such as calculus or differential equations) that students typically encounter in their first year of college to a more abstract outlook. It lays a foundation for more theoretical courses such as topology
- How to Prove It: A Structured Approach, 2nd Edition: Daniel J. Velleman: 9780521675994: Amazon.com: Books
- How to Prove It: A Structured Approach, 2nd Edition [Daniel J. Velleman] on Amazon.com. *FREE* shipping on qualifying offers. Geared to preparing students to make the transition from solving problems to proving theorems, this text teaches them the techniques needed to read and write proofs. The book begins with the basic concepts of logic and set theory
- How to Solve It: A New Aspect of Mathematical Method (Princeton Science Library): G. Polya, John H. Conway: 9780691164076: Amazon.com: Books
- How to Solve It: A New Aspect of Mathematical Method (Princeton Science Library) [G. Polya, John H. Conway] on Amazon.com. *FREE* shipping on qualifying offers. A perennial bestseller by eminent mathematician G. Polya, How to Solve It</i> will show anyone in any field how to think straight. In lucid and appealing prose
- Introduction to Artificial Intelligence: Second, Enlarged Edition (Dover Books on Mathematics): Philip C. Jackson Jr.: 9780486248646: Amazon.com: Books
- Introduction to Artificial Intelligence: Second, Enlarged Edition (Dover Books on Mathematics) [Philip C. Jackson Jr.] on Amazon.com. *FREE* shipping on qualifying offers. <div><div><P>Can computers think? Can they use reason to develop their own concepts, solve complex problems, play games
- Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science): Christos H. Papadimitriou, Kenneth Steiglitz: 9780486402581: Amazon.com: Books
- Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) [Christos H. Papadimitriou, Kenneth Steiglitz] on Amazon.com. *FREE* shipping on qualifying offers. <DIV>This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow
- Amazon.com: "They Say / I Say": The Moves That Matter in Academic Writing (Third Edition) (8601401247128): Gerald Graff, Cathy Birkenstein: Books
- Amazon.com: "They Say / I Say": The Moves That Matter in Academic Writing (Third Edition) (8601401247128): Gerald Graff, Cathy Birkenstein: Books
- Elephant in nLab
- Interaction Design Foundation
- Learn User Experience (UX) and Design from experts
- Phosphorous, The Popular Lisp | Lambda the Ultimate
- Jane Street Tech Blogs
- The True Believer: Thoughts on the Nature of Mass Movements (Perennial Classics): Eric Hoffer: 9780060505912: Amazon.com: Books
- The True Believer: Thoughts on the Nature of Mass Movements (Perennial Classics) [Eric Hoffer] on Amazon.com. *FREE* shipping on qualifying offers. “[Eric Hoffer] is a student of extraordinary perception and insight. The range of his reading and research is vast
- Y, Z and Simply Typed Lambda Calculus - 单子PL进修部 - 知乎专栏
- 知乎专栏
- Algorithmic Learning (Graduate Texts in Computer Science): Alan Hutchinson: 9780198538486: Amazon.com: Books
- Algorithmic Learning (Graduate Texts in Computer Science) [Alan Hutchinson] on Amazon.com. *FREE* shipping on qualifying offers. For the last few decades, machine learning has been the province of a few enthusiasts. Like other forms of artificial intelligence
- Essentials of Logic Programming (Graduate Texts in Computer Science): Christopher John Hogger: 9780198538325: Amazon.com: Books
- Essentials of Logic Programming (Graduate Texts in Computer Science) [Christopher John Hogger] on Amazon.com. *FREE* shipping on qualifying offers. Logic programming has developed into a broad discipline within computing science, contributing to such fields as artificial intelligence
- Tractatus Logico-Philosophicus - Wikipedia, the free encyclopedia
- Oz (programming language) - Wikipedia, the free encyclopedia
- Computational Complexity: A Modern Approach / Sanjeev Arora and Boaz Barak
- Andy Kessler: hwgh
- Free copy of book How We Got Here
- Could Your iPod Be Holding the Greatest Mystery in Modern Science?
- programming musings | random thoughts on programming and programming languages
- random thoughts on programming and programming languages (by jao)
- Publications
- Fundamental properties of infinite trees
- Unpublished Papers
- St. Andrews: Stephen Read
- 20111109.pdf
- Abstract Interpretation Winter School
- website description
- The Science of Programming (Monographs in Computer Science): David Gries: 9780387964805: Amazon.com: Books
- The Science of Programming (Monographs in Computer Science) [David Gries] on Amazon.com. *FREE* shipping on qualifying offers. Describes basic programming principles and their step-by- step applications.Numerous examples are included.
- Dependent Types and Multi-Monadic Effects in F*
- submission.pdf
- DeepSpec: The Science of Deep Specification
- VMCAI - Microsoft Research
- 16th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI)
- International Conference on Computer-Aided Verification
- Computer Aided Verification - Wikipedia, the free encyclopedia
- List of computer science conferences - Wikipedia, the free encyclopedia
- Art Of Community Online | The Book On Community Management, by Jono Bacon
- impromptu-shift-tr.dvi - TR611.pdf
- Arrow - HaskellWiki
- Software transactional memory - Wikipedia, the free encyclopedia
- Categorical quantum mechanics - Wikipedia, the free encyclopedia
- Plato and his dialogues : Welcome - Platon et ses dialogues : Bienvenue
- A new interpretation of Plato's dialogues as a progressive program of education for philosopher-kings, unfolding in seven tetralogies from Alcibiades to Laws, with the Republic as its logical center and the death of Socrates at the end of the Phaedo as its physical center.
- Plato and his dialogues : home
- A new interpretation of Plato's dialogues as a progressive program of education for philosopher-kings, unfolding in seven tetralogies from Alcibiades to Laws, with the Republic as its logical center and the death of Socrates at the end of the Phaedo as its physical center.
- [Haskell] Correct interpretation of the curry-howard isomorphism
- Combining abstract interpretation and theorem proving - Continuation - 知乎专栏
- 知乎专栏
- atp.pdf
- pldi11-inverse-synthesis.pdf
- Monad 和Comonad 漫谈 - 猫头鹰和小老鼠的小黑板 - 知乎专栏
- 知乎专栏
- RATIONALITY IN HUMAN LIFE (24-Nov-2001)
- Sage: A Programming Language with Hybrid Type-Checking
- In defense of program testing or correctness proofs considered harmful
- axiom K in nLab
- HMF: Simple Type Inference for First-Class Polymorphism - Microsoft Research
- Why only 'minimal' languages | Lambda the Ultimate
- The three dimensions of proofs | Lambda the Ultimate
- Deep Learning
- paper.dvi - faultylogic_esop2010.pdf
- ongoing by Tim Bray · On Custom Schemas
- compiler-certif.pdf
- Awelon Blue | Thoughts on Programming Experience Design
- Thoughts on Programming Experience Design
- dexprs.pdf
- Scheme Macro Programming
- Articles and examples of macro programming in Scheme, using low-level (a.k.a., defmacro) and R5RS (hygienic) macro systems.
- () - 1411.3962.pdf
- Algebraic logic - Wikipedia, the free encyclopedia
- Book Ratings -- Adam Chlipala
- Book Log -- Adam Chlipala
- arrows.pdf
- arrows-and-idioms.pdf
- afp-arrows.pdf
- ProdArrows -- Arrows for Fudgets
- big list - Suggestions for good notation - MathOverflow
- Reflective Program Generation with Patterns - Microsoft Research
- aaai02-alisp.pdf
- multithreading - Non-deterministic programming languages - Stack Overflow
- BartoszMilewski/Okasaki
- Okasaki - Functional data structures in C++
- On UI Layout « 3 + 4
- Linear Logical Algorithms | Lambda the Ultimate
- TLLP: A Temporal Linear Logic Programming Language and its Compiler System
- Inductively defined types in the Calculus of Constructions - viewcontent.cgi
- Programming Languages as Operating Systems (or, Revenge of the Son of the Lisp Machine)
- Design Principles Behind Smalltalk
- Cincom Smalltalk Tech Tips
- Smalltalk Jobs | Open Smalltalk programming positions from around the world.
- Open Smalltalk programming positions from around the world.
- ObjectStudio, Enfin | The home of everything ObjectStudio
- The home of everything ObjectStudio
- Digging in the dirt
- Software Reflections
- Welcome to randycoulman.com! - Courageous Software
- Welcome to randycoulman.com! I am Randy Coulman. I’ve been a software developer for more than 20 years. Today, I work
primarily in Ruby, …
- Runar Jordahl
- SICS_diss_37.pdf
- CJ.pdf
- Conal Elliott » Sequences, streams, and segments
- Comonads in everyday life. | fmap fix return
- This post is a literate haskell file. As is usual with such things, you can go ahead and paste it into a .lhs file and load it right up in ghci. As such, first some boring preliminaries. > module CoMenu where > import Control.Applicative; import Data.List; import Data.Tree; import Data.Maybe > import Network.Frameworks.HVAC; import Network.Frameworks.HVAC.AltController…
- A Neighborhood of Infinity: Evaluating cellular automata is comonadic
- Beluga
- program analysis - What is the goal behind abstract interpretation in programming languages? - Theoretical Computer Science Stack Exchange
- AcceptanceModels.doc - AcceptanceModels.pdf
- The calculus of constructions
- CiteSeerX — Programming with Intersection Types and Bounded Polymorphism
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): representing the official policies, either expressed or implied, of the U.S. Government.
- journal.pdf
- Programming with dependent types: passing fad or useful tool? - xavier.pdf
- The proof monad
- software recommendation - code highlight extension for Libre Office writer - Ask Ubuntu
- Using Dependent Types and Tactics to Enable Semantic Optimization of Language-Integrated Queries - dbpl15_slides.pdf
- Amazon.com: On Writing Well, 30th Anniversary Edition: The Classic Guide to Writing Nonfiction (9780060891541): William Zinsser: Books
- Amazon.com: On Writing Well, 30th Anniversary Edition: The Classic Guide to Writing Nonfiction (9780060891541): William Zinsser: Books
- 浮士德I - 维基百科,自由的百科全书
- How can I convince myself to tolerate an imperfect code I created so that I can spend time on more important things? - Quora
- The Kernel Programming Language
- newspeak-modules.pdf
- pmd.dvi - ecoop.pdf
- Lagarias3-23.pdf
- About | The polymath blog
- This group blog, together with its associated wiki, is intended to host "polymath" projects - massively collaborative mathematical research projects. The ground rules for such projects can be found here. Note that LaTeX is supported in the comments of this blog. Unfortunately, comment editing and preview is not available; you will need to contact a…
- Polymath1Wiki
- paide.pdf
- Towards a duration calculus proof assistant in PVS - Springer
- The PhoX Proof Assistant
- IMPS Home Page
- Theorema 2.0: A Graphical User Interface for a Mathematical Assistant System (PDF Download Available)
- Official Full-Text Publication: Theorema 2.0: A Graphical User Interface for a Mathematical Assistant System on ResearchGate, the professional network for scientists.
- windsteiger/Theorema
- Theorema: A System for Automated Reasoning (Theorem Proving) and Automated Theory Exploration based on Mathematica
- comparison.pdf
- C◦mp◦se :: Conference
- Compose is a new conference for typed functional programmers, focused specifically on Haskell, OCaml, F#, SML, and related technologies.
- Statistical Data Mining Tutorials
- Knowing and the Mystique of Logic and Rules - including True | P. Naur | Springer
- Human knowing is examined as it emerges from classical empirical psychology, with its ramifications into language, computing, science, and scholarship.
- INTR-04.PDF
- 【東方×HYPER TECHNO】 SPEED NONSTOP MIXXx! 【21みっくすめ】 - YouTube
- TUMENECO - Dream and Reality (現夢 Genmu) -Disc1- Release date: 2011-08-13 (Comiket 80) It is an vocal and instrumental album featuring arrangements from Story...
- fogus: 2015
- Pseudo-random ramblings from Fogus.
- fogus: 2014
- Pseudo-random ramblings from Fogus.
- fogus: 2010
- Pseudo-random ramblings from Fogus.
- fogus: 2009
- Pseudo-random ramblings from Fogus.
- fogus: 2007
- Pseudo-random ramblings from Fogus.
- fogus: 2006
- Pseudo-random ramblings from Fogus.
- fogus: 2004
- Pseudo-random ramblings from Fogus.
- fogus: 2003
- Pseudo-random ramblings from Fogus.
- CiteSeerX — Fundamentals Of Deductive Program Synthesis
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): An informal tutorial is presented for program synthesis, with an emphasis on deductive methods. According to this approach, to construct a program meeting a given specification, we prove the existence of an object meeting the specified conditions. The proof is restricted to be sufficiently constructive, in the sense that, in establishing the existence of the desired output, the proof is forced to indicate a computational method for finding it. That method becomes the basis for a program that can be extracted from the proof. The exposition is based on the deductive-tableau system, a theorem-proving framework particularly suitable for program synthesis. The system includes a nonclausal resolution rule, facilities for reasoning about equality, and a well-founded induction rule. INTRODUCTION This is an introduction to program synthesis, the derivation of a program to meet a given specification. It focuses on the deductive approach, in which the derivation task is regarded as a problem of ...
- Amir Pnueli, Roni Rosner: On the Synthesis of a Reactive Module - Bing
- Sumit Gulwani: Automating string processing in spreadsheets using input-output examples - Bing
- Emanuel Kitzelmann and Ute Schmid: Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach - Bing
- Ray Solomonoff - Wikipedia, the free encyclopedia
- Making it stick.
- Making it stick.
- Making it stick.
- Making it stick.
- NMCS4ALL: Artificial Life (full version) - YouTube
- A half-hour introduction to concepts of artificial life, with demos. Cut-down version at http://www.youtube.com/watch?v=ws41PAG92xU The New Mexico CS for All...
- Visualizing and Understanding Deep Neural Networks by Matt Zeiler - YouTube
- For more tech talks and to network with other engineers, check out our site https://www.hakkalabs.co/logs Matthew Zeiler, PhD, Founder and CEO of Clarifai In...
- dsl-paper.pdf
- HANSEI: Embedded Probabilistic Programming
- Design and implementation of the embedded DSL for probabilistic programming. Examples of models, inference and nested inference
- An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science) 3, Ming Li, Paul Vitányi - Amazon.com
- An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science) - Kindle edition by Ming Li, Paul Vitányi. Download it once and read it on your Kindle device, PC, phones or tablets. Use features like bookmarks, note taking and highlighting while reading An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science).
- [1412.4053] Running Probabilistic Programs Backwards
- toronto-2015esop-slides.pdf
- KnuthsModel - Xmlgraphics-fop Wiki
- PII: S0364-0213(87)80026-5 - LarkinSimon87.pdf
- Visual Programming Language Syntax Formalisms | Lambda the Ultimate
- Human Factors Research On Programming Language Syntax | Lambda the Ultimate
- A mathematical logic without variables ... (Book, 1935) [WorldCat.org]
- Get this from a library! A mathematical logic without variables .... [J Barkley Rosser]
- Intelligent Robots Should Maximize Their Future Options | NooTriX
- Dr. Alexander D. Wissner-Gross
- Dr. Alexander D. Wissner-Gross is an award-winning scientist, inventor, entrepreneur, and angel investor.
- Dual-Intuitionistic Logic
- Dual-Intuitionistic Logic on ResearchGate, the professional network for scientists.
- Smalltalk Best Practice Patterns: Kent Beck: 9780134769042: Amazon.com: Books
- Smalltalk Best Practice Patterns [Kent Beck] on Amazon.com. *FREE* shipping on qualifying offers. <DIV style= WIDOWS: 2; TEXT-TRANSFORM: none; BACKGROUND-COLOR: rgb(255, 255, 255); TEXT-INDENT: 0px; MARGIN: 0px 0px 1em; FONT: small verdana
- Smalltalk With Style: Suzanne Skublics, Edward J. Klimas, David A. Thomas, John Pugh: 9780131655492: Amazon.com: Books
- Smalltalk With Style [Suzanne Skublics, Edward J. Klimas, David A. Thomas, John Pugh] on Amazon.com. *FREE* shipping on qualifying offers. Bridging the gap between well established software engineering principles and the real-world practice of programming
- Research objectives - Dil.7.5.17.pdf
- The Axis of Eval
- Room 101
- dynamic aspects | experiments in interactive programming
- Lambdor Devblog by Gerold Meisinger - Haskell, FRP Yampa and game development
- Nothing Personal
- Dataspace Project | Better muttering through mad science
- Better muttering through mad science
- Inner Vs Super
- Bootstrapping a Type System – journal.stuffwithstuff.com
- On understanding data abstraction, revisited
- W-types: good news and bad news « Epilogue
- Quotients « Epilogue
- What’s Special About Identity Types | Homotopy Type Theory
- From a homotopy theorist's point of view, identity types and their connection to homotopy theory are perfectly natural: they are "path objects" in the category of types. However, from a type theorist's point of view, they are somewhat more mysterious. In particular, identity types are just one particular inductive family; so what's special about them…
- refinements.pdf
- Mathematical quotients and quotient types in Coq
- 清醒思考的艺术 (豆瓣)
- 图书清醒思考的艺术 介绍、书评、论坛及推荐
- rooter.pdf
- () - rap.pdf
- Xin Zhang's Homepage
- A User-Guided Approach to Program Analysis - fse15a.pdf
- The Psychology of Problem Solving: 9780521797412: Medicine & Health Science Books @ Amazon.com
- The Psychology of Problem Solving: 9780521797412: Medicine & Health Science Books @ Amazon.com
- Generative Programming: Methods, Tools, and Applications: Krysztof Czarnecki, Ulrich Eisenecker: 0785342309775: Amazon.com: Books
- Generative Programming: Methods, Tools, and Applications [Krysztof Czarnecki, Ulrich Eisenecker] on Amazon.com. *FREE* shipping on qualifying offers. Generative Programming (GP) offers the promise of moving from one-of-a-kind software systems to the semi-automated manufacture of wide varieties of software -- essentially
- Proof Certificates and Geometry
- CDuce: Papers and talks
- icfp11.pdf
- jfp614.dvi - 06-jfp-yi.pdf
- acmjournal.dvi - semantic_subtyping.pdf
- Learnable Programming
- On the complexity of flow-sensitive dataflow analyses
- ECS-LFCS-97-375.pdf
- Color&Color+
- 全世界的ハートフルデュエットを七色のGirls Loveで… 甘い果実をまるごとギュギュっと詰め込んだも・ぎ・た・て?デュエットアルバムを召し上がれ♪
- Visual Languages: Alligator Eggs (for the last time)
- Visual Languages: Algebraic approach to graph transformation
- Visual Languages: Graph Parser Combinators
- Visual Languages: VEX
- Visual Languages: Bidirectional synchronization
- Visual Languages: Constraint Logic Programming and Diagram Completion
- Visual Languages: Usability
- C&C - Learn You Some Category Theory
- C&C - Please Don't Learn Category Theory to Learn Haskell
- C&C - Examining Hackage: logict
- C&C - Type is not in Type
- C&C - Solving Recursive Equations
- C&C - Coinduction in JonPRL for Low Low Prices
- C&C - Proving Cut Admissibility in Twelf
- C&C - Compiling a Lazy Language in 1,000 words
- C&C - Bracket Abstraction: The Smallest PL You've Ever Seen
- C&C - A Twelf Introduction
- C&C - Worlds in Twelf
- C&C - Notes on Proof Theory: Part 1
- C&C - What Are Impredicative Types?
- C&C - Notes on Focusing
- C&C - Update on Old Projects
- C&C - Notes on Quotients Types
- C&C - The Guts of a Spineless Machine
- C&C - Many Shades of Halting Oracles
- C&C - Examining Hackage: extensible-effects
- C&C - Dissecting crush
- C&C - Colleges and My Not-So-Distant Future
- tldi22-sulzmann-with-appendix.pdf
- Injective Type Families for Haskell - injective-type-families-acm.pdf
- coercible.pdf
- fc-normalization-rta.pdf
- Equality proofs and deferred type errors (A compiler pearl) - icfp12.pdf
- promotion.pdf
- fc-new-tyco.pdf
- popl163af-weirich.pdf
- Haskell for all
- Haskell for all: Program imperatively using Haskell lenses
- Maximum entropy probability distribution - Wikipedia, the free encyclopedia
- http://people.cis.ksu.edu/~schmidt/text/densem.html
- The Reduceron
- Polyvariadic functions and keyword arguments
- Case analysis on the type of the function or continuation: implementing functions with the variable number of arguments or keyword arguments
- Haskell Programming
- The index page for the Haskell portion of the site; Haskell tips and tricks
- kan-extensions: Kan extensions, Kan lifts, various forms of the Yoneda lemma, and (co)density (co)monads | Hackage
- Free Monads and the Yoneda Lemma - Higher Order
- Last week I gave a talk on Purely Functional I/O at Scala.io in Paris. The slides for the talk are available here. In it I presented a data type for …
- A Neighborhood of Infinity: Reverse Engineering Machines with the Yoneda Lemma
- A Neighborhood of Infinity
- Higher Order
- I’ve been having fun exploring adjunctions lately and thinking about how we can take a monad apart and compose it the other way to get a …
- What Purity Is and Isn’t - Higher Order
- A lot of discussion about “purity” goes on without participants necessarily having a clear idea of what it means exactly. Such discussion …
- Yacc is dead: An update
- Universal logic - Wikipedia, the free encyclopedia
- A Tutorial on Proof Theoretic Foundations of Logic Programming - PrThFoundLP.pdf
- llchr-final0.pdf
- PhD Thesis
- Russell O’Connor’s Blog
- Typed X (Racket, Clojure, Lua) just doesn't pan out? | Lambda the Ultimate
- Bedrock case study, modular program verification | Lambda the Ultimate
- icfp06.pdf
- mbeddr: an Extensible C-based Programming Language and IDE for Embedded Systems | Lambda the Ultimate
- HOPE 2012 :: The 1st ACM SIGPLAN Workshop on Higher-Order Programming with Effects
- Slide 1 - 2012-overviewkoka.pdf
- Dynamic Epistemic Logic (豆瓣)
- 图书Dynamic Epistemic Logic 介绍、书评、论坛及推荐
- Logic in Computer Science (豆瓣)
- 图书Logic in Computer Science 介绍、书评、论坛及推荐
- Introduction to the Theory of Computation (豆瓣)
- 图书Introduction to the Theory of Computation 介绍、书评、论坛及推荐
- Computability (豆瓣)
- 图书Computability 介绍、书评、论坛及推荐
- 没有时间的世界 (豆瓣)
- 图书没有时间的世界 介绍、书评、论坛及推荐
- Foundations for Programming Languages (豆瓣)
- 图书Foundations for Programming Languages 介绍、书评、论坛及推荐
- 动态偏好逻辑 (豆瓣)
- 图书动态偏好逻辑 介绍、书评、论坛及推荐
- 图灵的秘密 (豆瓣)
- 图书图灵的秘密 介绍、书评、论坛及推荐
- 乌合之众 (豆瓣)
- 图书乌合之众 介绍、书评、论坛及推荐
- The Classical Decision Problem (豆瓣)
- 图书The Classical Decision Problem 介绍、书评、论坛及推荐
- 研究之美 (豆瓣)
- 图书研究之美 介绍、书评、论坛及推荐
- 算法设计 (豆瓣)
- 图书算法设计 介绍、书评、论坛及推荐
- 形而上学 (豆瓣)
- 图书形而上学 介绍、书评、论坛及推荐
- fission.pdf
- College Publications - Logic PhDs
- The Road to Universal Logic - Springer
- The Road to Universal Logic - Festschrift for the 50th | Arnold Koslow | Springer
- This second volume of a collection of papers offers new perspectives and challenges in the study of logic. It is presented in honor of the fiftieth
- Logical Autobiography 50 - Springer
- Logica Universalis - incl. option to publish open access
- Logica Universalis (LU) publishes peer-reviewed research papers related to universal features of logics. Topics include general tools and techniques for studying already existing logics and building new ones, the study of classes ...
- The Plaid Programming Language
- Multiple instances - HaskellWiki
- Implementing a JIT Compiler with Haskell and LLVM ( Stephen Diehl )
- Scott Berkun | Author and Speaker Scott Berkun
- Author and Speaker Scott Berkun
- CIS194
- Write You a Haskell ( Stephen Diehl )
- Type Classes with Functional Dependencies
- User:ConradParker/InstantInsanity - HaskellWiki
- http://www.lix.polytechnique.fr/Labo/Bruno.Barras/proofs/sets/index.html
- Ens
- What I Wish I Knew When Learning Haskell 2.3 ( Stephen Diehl )
- Immanuel Kant - Wikipedia, the free encyclopedia
- monadicDC.pdf
- lambda calculus - Can Scheme's call/cc implement all known control flow structures? - Theoretical Computer Science Stack Exchange
- TR205.pdf
- Reification (computer science) - Wikipedia, the free encyclopedia
- All You Need Is Call/cc - Paul Khuong: some Lisp
- [1601.05106] Sound and Complete Bidirectional Typechecking for Higher-Rank Polymorphism with Existentials and Indexed Types
- main-e.pdf
- Final Shift for Call/cc: Direct Implementation of Shift and Reset (PDF Download Available)
- Official Full-Text Publication: Final Shift for Call/cc: Direct Implementation of Shift and Reset on ResearchGate, the professional network for scientists.
- popl90.pdf
- CW684.pdf
- Cyclone: Papers
- http://homepages.inf.ed.ac.uk/wadler/papers/free-rectypes/free-rectypes.txt
- Lens/Aeson Traversals/Prisms - School of Haskell | School of Haskell
- Imgur
- VNof931.jpg (JPEG Image, 600 × 848 pixels) - Scaled (90%)
- Master can I really eat all this!? - Imgur
- Images from /r/touhou/comments/43dsyw/master_can_i_really_eat_all_this/
Bookmarks Toolbar
- Add bookmarks to this folder to see them displayed on the Bookmarks Toolbar
- Send More Paramedics
- Newest questions tagged pl.programming-languages - Theoretical Computer Science Stack Exchange
- New in-depth guide to stack | FP Complete
-
- Practical Haskell - Getting Started with Stack
-
- Nodewar
-
- Free reference manager and PDF organizer | Mendeley
- Easily organize your papers, read & annotate your PDFs, collaborate in private or open groups, and securely access your research from everywhere.
- The Curse of the Excluded Middle - ACM Queue
-
- When Will Evolution Outperform Local Search? – evorithmics
- Recombinative evolution will outperform local search on fitness functions that have a property I call deep contingency. To develop and support this claim I will: Present a non-hierarchical, whitebox fitness function possessing the property in question and empirically show that a genetic algorithm handily outperforms simulated annealing. Explain why simulated annealing, and indeed, local search of any kind, is the wrong way…
- November | 2015 | NP-Incompleteness
- 1 post published by kunigami during November 2015
- October | 2015 | NP-Incompleteness
- 2 posts published by kunigami during October 2015
- August | 2015 | NP-Incompleteness
- 2 posts published by kunigami during August 2015
- July | 2015 | NP-Incompleteness
- 1 post published by kunigami during July 2015
- May | 2015 | NP-Incompleteness
- 1 post published by kunigami during May 2015
- April | 2015 | NP-Incompleteness
- 1 post published by kunigami during April 2015
- March | 2015 | NP-Incompleteness
- 1 post published by kunigami during March 2015
- January | 2015 | NP-Incompleteness
- 2 posts published by kunigami during January 2015
- December | 2014 | NP-Incompleteness
- 1 post published by kunigami during December 2014
- October | 2014 | NP-Incompleteness
- 1 post published by kunigami during October 2014
- July | 2014 | NP-Incompleteness
- 1 post published by kunigami during July 2014
- December | 2013 | NP-Incompleteness
- 1 post published by kunigami during December 2013
- November | 2013 | NP-Incompleteness
- 1 post published by kunigami during November 2013
- October | 2013 | NP-Incompleteness
- 1 post published by kunigami during October 2013
- September | 2013 | NP-Incompleteness
- 1 post published by kunigami during September 2013
- August | 2013 | NP-Incompleteness
- 1 post published by kunigami during August 2013
- July | 2013 | NP-Incompleteness
- 1 post published by kunigami during July 2013
- April | 2013 | NP-Incompleteness
- 1 post published by kunigami during April 2013
- About | Control.Monad.Writer
- Don Stewart I spent the 2000s completing a PhD in computer science at UNSW in Sydney, developing new approaches to dynamic extension and hot swapping features for the Haskell programming language. I also worked on compiler optimizations for GHC, leading to "stream fusion" (parodied in this comic strip). At the same time I squeezed in a lot of…
- Functional Programming, Abstraction, and Names
- {{description}}
- Reflecting on Haskell in 2015
- {{description}}
- A Haskell Implementation Reading List
- {{description}}
- The Missing Unboxed Vector Library
- {{description}}
- A Vim + Haskell Workflow
- {{description}}
- From Adjunctions to Monads
- {{description}}
- C&C - Compiling With CPS
-
- C&C - Value vs Monomorphism Restriction
-
- C&C - A Tiny Compiler For A Typed Higher Order Language
-
- C&C - An Explanation of Type Inference for ML/Haskell
-
- C&C - Examining Hackage: folds
-
- C&C - Examining Hackage: operational
-
- C&C - Treating Programs like Vending Machines
-
- C&C - Cooking λΠ 3 ways
-
- C&C - Examining Hackage: concurrent-supply
-
- C&C - Functors and Recursion
-
- C&C - Notes on Abstract and Existential Types
-
- C&C - Introduction to Dependent Types: Off, Off to Agda Land
-
- C&C - Introduction to Dependent Types: Haskell on Steroids
-
- C&C - Equality is Hard
-
- Minimal logic - Wikipedia, the free encyclopedia
-
- Reflecting values to types and back - School of Haskell | School of Haskell
-
- Typed type-level programming in Haskell, part IV: collapsing types and kinds | blog :: Brent -> [String]
- In Part III, we saw how the current state of the art in Haskell type-level programming leaves some things to be desired: it requires duplicating both data declarations and code, and even worse, it's untyped. What to do? Currently, GHC's core language has three "levels": Expressions: these include things like term variables, lambdas, applications, and…
- OSPF - YouTube
- Computer Networking Nerds spoof on the YMCA song
- 【板毁】雾雨魔理沙 & 爱丽丝_东方吧_百度贴吧
-
- 【喵玉汉化_1403】Present for_东方吧_百度贴吧
-
- 【板绘】骷髅骠骑兵阿燐~_东方吧_百度贴吧
-
- Quark : A Web Browser with a Formally Verified Kernel
-
- Automating Formal Proofs for Reactive Systems
-
- Sorin Lerner
-
- Fields Institute - Workshop on Homotopy Type Theory
-
- 【物语AMV】大概是一个爱情故事_MAD·AMV_动画_bilibili_哔哩哔哩弹幕视频网
- 自制 AK纯碱作,突然的想法,做了大概两个月,主要后来考试太忙了,拖了挺久,总之很开心做完了! 然后自己也做了将近两年的MAD了,虽然只有几个渣作,不过也算认识了一些朋友,很开心~ 然后还要感谢一直帮助我的C大,也算是对我的启蒙老师了。。 之所以这次废话比较多,因为参加了次AK,我也总算可以安心退坑准备考研了_(:3」∠)_
- Microsoft Word - Clarke.doc - 13th-clarke.pdf
-
- fogus: Functional Shmunctional
- Pseudo-random ramblings from Fogus.
- Reflections on standard ML - Springer
-
- Dave Thomas Publications
- A list of reports, papers and publications by object-oriented software expert, Dave Thomas
- Elm
-
- Types for Proofs and Programs - Springer
-
- Sjoerd Visscher's weblog - Saturday, March 09, 2002 - w3future.com
- My ideas about new web technology that can change the future of the world wide web.
- JFP.pdf
-
- 【東方アレンジ】 Demetori - 妖々跋扈 ~ Who done it!!! - YouTube
- Title: 妖々跋扈 ~ Who done it!!! Artist: Demetori Circle: Demetori Album: le Grimoire De reve Released Date: Dec 31, 2013 (Comiket 85) http://www.kawachi.zaq.ne....
- Ryuichi Sakamoto - Futurista (Vinyl, LP, Album) at Discogs
- Find a Ryuichi Sakamoto - Futurista first pressing or reissue. Complete your Ryuichi Sakamoto collection. Shop Vinyl and CDs.
- Writing the Statement of Purpose | Berkeley Graduate Division
-
- Drawing Programs: The Theory and Practice of Schematic Functional Programming - Springer
-
- [1509.00913] On-the-Fly Learning in a Perpetual Learning Machine
-
- THE CURRY-HOWARD ISOMORPHISM ADAPTED FOR IMPERATIVE PROGRAM SYNTHESIS AND REASONING
- THE CURRY-HOWARD ISOMORPHISM ADAPTED FOR IMPERATIVE PROGRAM SYNTHESIS AND REASONING on ResearchGate, the professional network for scientists.
- Computer Laboratory – Course material 2010–11: Usability of Programming Languages
-
- Cognitive dimensions of notations - Wikipedia, the free encyclopedia
-
- Arrays, Functional Languages, and Parallel Systems | Lenore M. Restifo Mullin | Springer
- During a meeting in Toronto last winter, Mike Jenkins, Bob Bernecky and I were discussing how the two existing theories on arrays influenced or were in
- [Haskell-cafe] Symbolic differentation using GHC's simplification rules
-
- fpca.dvi - db-utwente-40501F46.pdf
-
- Combinatorial species - Wikipedia, the free encyclopedia
-
- Type Inference in the Presence of Subtyping: from Theory to Practice
- From a purely theoretical point of view, type inference for a functional language with parametric polymorphism and subtyping poses little difficulty. Indeed, it suffices to generalize the inference algorithm used in the ML language, so as to deal with type inequalities, rather than equalities. However, the number of such inequalities is linear in the program size-whence, from a practical point of view, a serious efficiency and readability problem. To solve this problem, one must simplify the inferred constraints. So, after studying the logical properties of subtyping constraints, this work proposes several simplification algorithms. They combine seamlessly, yielding a homogeneous, fully formal framework, which directly leads to an efficient implementation. Although this theoretical study is performed in a simplified setting, numerous extensions are possible. Thus, this framework is realistic, and should allow a practical appearance of subtyping in languages with type inference. This document is the English version of the author's PhD thesis.
- Getting F-Bounded Polymorphism into Shape
-
- ecoop01-ernst.pdf
-
- OOHaskell - 0509027.pdf
-
- book.pdf
-
- seplogic.pdf
-
- 15-818A3 Introduction to Separation Logic
-
- 15-819A Srping 2000 Description
-
- jonsterling/type-theory-and-its-meaning-explanations: an introduction to type theory based on meaning explanations (as opposed to proof theoretic type theories)
- type-theory-and-its-meaning-explanations - an introduction to type theory based on meaning explanations (as opposed to proof theoretic type theories)
- (Constructive Type Theory) A Non-Type-Theoretic Definition of Martin-Lof's Types - Stuart Allen 1987
-
- PII: 0747-7171(92)90026-Z - Harper-JSC92.pdf
-
- Equality in Lazy Computation Systems, by Douglas J. Howe
-
- 15-317 Constructive Logic
- Constructive Logic
- 15-816 Linear Logic
- Linear Logic
- 15-816 Modal Logic
- Modal Logic
- Semantics of Programming Languages: Structures and Techniques (Foundations of Computing): 9780262071437: Computer Science Books @ Amazon.com
- Semantics of Programming Languages: Structures and Techniques (Foundations of Computing): 9780262071437: Computer Science Books @ Amazon.com
- CiteSeerX — Domain Theory
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Least fixpoints as meanings of recursive definitions.
- arXiv:math/9405205v1 [math.LO] 20 May 1994 - 9405205v1.pdf
-
- blog :: Brent -> [String]
- (by Brent)
- 网易云音乐 听见好时光
- 网易云音乐是一款专注于发现与分享的音乐产品,依托专业音乐人、DJ、好友推荐及社交功能,为用户打造全新的音乐生活。
- diff.pdf
-
- 【Halozy】 「Momobako」 パチュリコ (katsu+sumijun R&B HOUSE Revival) - YouTube
- Share your videos with friends, family, and the world
- Back to the future (panel session)
-
- unicoq-journal.pdf
-
- unif.pdf
-
- The Rise of ``Worse is Better''
-
- WorseIsBetterPositionPaper.fm6 - WorseIsBetterPositionPaper.pdf
-
- ProWorseIsBetterPosition.fm6 - ProWorseIsBetterPosition.pdf
-
- Species subtraction made simple | blog :: Brent -> [String]
- > {-# OPTIONS_GHC -fno-warn-missing-methods #-} > module Virtual where > > import Control.Applicative > import Test.QuickCheck Yesterday on #haskell, augur asked me to explain how subtraction works for combinatorial species. (For an introduction to species, see my paper from the 2010 Haskell Symposium.) For example, given the equation$latex M = 1 + X$defining the species…
- RNNs in Darknet
- Recurrent neural networks are all the rage for time-series data and NLP. Learn how to use them in Darknet!
- 長鋏中篇作品全文閱讀_長鋏中篇作品TXT全集下載_雲台書屋
- 長鋏中篇作品全文閱讀,長鋏中篇作品txt下載,長鋏中篇作品最新章節,盡在雲台書屋
- Seven trees in one
- There exists a surprising O(1) bijection between the datatype of unlabelled (planar) binary trees and 7-tuples of these trees. This presentation shows how this…
- NEPLS2-04.pdf
-
- pp.pdf
-
- fool2012_submission_3.pdf
-
- { work }: WTF is F-Bounded Polymorphism
- Here's an example of where I read random articles just because the title is very catchy: F-Bounded Polymorphism for Object-Oriented Programming by Peter Canning, William Cook, Walter Hill, Walter Olthoff and John Mitchell. Polymorphism is already confusing enough. Just look...
- Scala School - Advanced types
-
- f-bounded.pdf
-
- logji: F-Bounded Type Polymorphism Considered Tricky
-
- OnUnderstanding.A4.pdf
-
- CookPOPL90.pdf
-
- soundx-popl16.pdf
-
- Lenses-Folds-and-Traversals-NYC.pdf
-
- Languages as libraries - p132-tobin-hochstadt.pdf
-
- tc-tfs.pdf
-
- C&C - Notes on Parametricity
-
- CiteSeerX — Logic Programming with Focusing Proofs in Linear Logic
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): The deep symmetry of Linear Logic [18] makes it suitable for providing abstract models of computation, free from implementation details which are, by nature, oriented and non symmetrical. I propose here one such model, in the area of Logic Programming, where the basic computational principle is Computation = Proof search.
- Links meeting at ETAPS
-
- Comparing Objective Caml and Standard ML
-
- Amazon.com: The Secret of Inner Strength: My Story (9780316611916): Chuck Norris, Joe Hyams: Books
- Amazon.com: The Secret of Inner Strength: My Story (9780316611916): Chuck Norris, Joe Hyams: Books
- 七树归一 -- dramforever
-
- Grundzüge der Theoretischen Logik | David Hilbert | Springer
- Grundzüge der Theoretischen
- Self-verifying theories - Wikipedia, the free encyclopedia
-
- Dan Willard
-
- jsl5.pdf
-
- Hilbert system - Wikipedia, the free encyclopedia
-
- Continuous functional calculus - Wikipedia, the free encyclopedia
-
- Operator theory - Wikipedia, the free encyclopedia
-
- Umbral calculus - Wikipedia, the free encyclopedia
-
- Functional calculus - Wikipedia, the free encyclopedia
-
- C*-algebra - Wikipedia, the free encyclopedia
-
- [funct-an/9706007] The functional calculus for regular operators in Hilbert C*-modules revisited
-
- Hilbert's second problem - Wikipedia, the free encyclopedia
-
- Gentzen's consistency proof - Wikipedia, the free encyclopedia
-
- church.pdf
-
- coq-ext-lib/GraphAlgos.v at master · coq-ext-lib/coq-ext-lib
- coq-ext-lib - A library of Coq definitions, theorems, and tactics.
- Winckel.article.TAAPSD.pdf
-
- Sumit Gulwani's Homepage
-
- oopsla15-pbe.pdf
-
- sigmod14.pdf
-
- Microsoft Program Synthesis using Examples SDK
- Microsoft PROSE is a framework of technologies for automatic generation of programs from input-output examples, keywords, and similar forms of imprecise specification. In PROSE, you define a domain-specific language (DSL) of programs that constitute your domain of useful tasks (e.g. a DSL of CSS selectors). At runtime, you give PROSE some (typically user-provided) input-output examples for the desired program’s behavior, and its algorithms synthesize a ranked set of programs from this DSL that are consistent with the given examples. These programs can be saved and applied on similar user data after one learning session (typically with 1-4 examples). PROSE can be used to enable programming-by-example experience in an arbitrary user-facing application, provided the app developer describes its application domain in a DSL form.
As part of the project, the PROSE framework includes a set of specific technologies for various data wrangling domains. These include FlashFill, a library of string transformations from Microsoft Excel 2013, text extraction library with a DSL of programs that find a desired sequence of regions in a textual file, and a web extraction library with a CSS-based DSL of programs that select a set of elements on a web page. All three data wrangling libraries, as well as the underlying program synthesis framework, can currently be used out of the box for research, education, and other non-commercial initiatives.
- Fast congruence closure and extensions
-
- NimbusSanL-Regu - lang_study.pdf
-
- Template Haskell Is Not Scary
- A Beginner Tutorial
- PhoasICFP08Talk.pdf
-
- Pedestrian Statistics
-
- big list - Open problems on the frontiers of TCS - Theoretical Computer Science Stack Exchange
-
- Smalltalk-80: Bits of History, Words of Advice (Addison-Wesley series in computer science): Glen Krasner: 9780201116694: Amazon.com: Books
- Smalltalk-80: Bits of History, Words of Advice (Addison-Wesley series in computer science) [Glen Krasner] on Amazon.com. *FREE* shipping on qualifying offers. Small talk- 80/ Bits of History
- Topic: (/)
-
- Index of /afs/cs/project/ai-repository/ai/lang/lisp/code/syntax/haskell
-
- Index of /afs/cs/project/ai-repository/ai/pubs/lists
-
- LtU Classic Archives
-
- Package: areas/kr/systems/ontic/
-
- William Cook's Fusings
-
- William Cook's Fusings: Enso Introduction
-
- Ensō Blog > Don't design your programs… Program your designs!
-
- Out of the Tar Pit - download
-
- Functional Relational Programming: Out of the tar pit | Lambda the Ultimate
-
- Transactional Actor Model
-
- Architectural Styles and the Design of Network-based Software Architectures
-
- XSP Technology
-
- Stressed by Distributed Programming? Well, CALM Down. | Lambda the Ultimate
-
- ensogrammars.pdf
-
- ensodata.dvi - ensodata.pdf
-
- Enso
- Your description goes here
- SPLASH 2012
- SPLASH
- 2012-07-13EnsoMSR.pdf
-
- Currying in Smalltalk « 3 + 4
-
- DiGiTAL WiNG (album) - Touhou Wiki - Characters, games, locations, and more
-
- The Theory of Parametricity in Lambda Cube
- The Theory of Parametricity in Lambda Cube on ResearchGate, the professional network for scientists.
- ctcs04-camera-HS.pdf
-
- THE WORLD QUESTION CENTER 2005
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- Audiocasts - ACM Queue
-
- Yale FLINT Group: Parallel Cost Analysis
-
- The Logic Machine: Logic Software at Texas A&M University
- Logic Machine at Texas A&M University
- Elements Of Functional Programming (International Computer Science Series): Chris Reade: 9780201129151: Amazon.com: Books
- Elements Of Functional Programming (International Computer Science Series) [Chris Reade] on Amazon.com. *FREE* shipping on qualifying offers. <P>This book gives a lucid and thorough account of the concepts and techniques used in modern functional programming languages. Standard ML is used for notation
- 07-Elements-of-Functional-Programming.dvi - CS422-Fall-2007-07.pdf
-
- Why Programming Languages?
-
- What is AmbientTalk about? [ Ambient-Oriented Programming]
-
- Ambient Oriented Programming (AmOP) | Lambda the Ultimate
-
- Lisp-Stat Information
- Lisp-Stat Information
- Baby Steps
- Over the last week or so, I’ve been working on an update to
Rayon, my experimental library for data parallelism in
Rust. I’m pretty happy …
- Icon (programming language) - Wikipedia, the free encyclopedia
-
- Microsoft Word - surveyacm1.doc - NoviceProgSurvey.pdf
-
- Matt Calabrese, Zachary Laine: Instantiations Must Go! - YouTube
- In an effort to write a simple metafunction as part of a BoostCon09 session, the presenters tried to do something odd — to write the metafunction without any...
- Temporal Higher Order Contracts | Lambda the Ultimate
-
- Programmatic and Direct Manipulation, Together at Last | Lambda the Ultimate
-
- Performance Problems You Can Fix: A Dynamic Analysis of Memoization Opportunities | Lambda the Ultimate
-
- Progress on Gradual Typing | Lambda the Ultimate
-
- popl16-tfgnvf.pdf
-
- Abstracting Gradual Typing - garciaAl-popl2016.pdf
-
- banadosAl-icfp2014.pdf
-
- Computer Science - Brian Kernighan on successful language design - YouTube
- Professor Brian Kernighan presents on 'How to succeed in language design without really trying.' Brian Kernighan is Professor of Computer Science at Princeto...
- Formalization and programming language design -- explained to all | Lambda the Ultimate
-
- jbclements/rust-redex: A Redex Model of Rust, or more specifically an encoding of Patina, the formal model for rust's type safety
- rust-redex - A Redex Model of Rust, or more specifically an encoding of Patina, the formal model for rust's type safety
- concept lattice | planetmath.org
-
- Set theory - Wikipedia, the free encyclopedia
-
- Tarski–Grothendieck set theory - Wikipedia, the free encyclopedia
-
- Urelement - Wikipedia, the free encyclopedia
-
- New Foundations - Wikipedia, the free encyclopedia
-
- Morse–Kelley set theory - Wikipedia, the free encyclopedia
-
- CtCoq: a system presentation (PDF Download Available)
- Official Full-Text Publication: CtCoq: a system presentation on ResearchGate, the professional network for scientists.
- A Hybrid Logical Framework [color] by Jason Reed (Paperback) - Lulu
- Buy A Hybrid Logical Framework [color] by Jason Reed (Paperback) online at Lulu. Visit the Lulu Marketplace for product details, ratings, and reviews.
- Selections From Perido de Mar by J. C. Reed (Paperback) - Lulu
- Buy Selections From Perido de Mar by J. C. Reed (Paperback) online at Lulu. Visit the Lulu Marketplace for product details, ratings, and reviews.
- Knowing and Doing: October 2005 Archives
-
- LtU Classic Archives
-
- Lambda, the Ultimate TA: Using a Proof Assistant to Teach Programming Language Foundations on Vimeo
- Lambda, the Ultimate TA: Using a Proof Assistant to Teach Programming Language Foundations Benjamin C. Pierce; University of Pennsylvania International Conference…
- LtU Classic Archives
-
- A theory of data parallel computing | Lambda the Ultimate
-
- Bling UI Toolkit - Home
-
- inlining.pdf
-
- Algebra Of Programming (Bird, De Moor) | Lambda the Ultimate
-
- CiteSeerX — Knowledge-based Cooperation between Theorem Provers by TECHS
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): We present a methodology for coupling several saturation-based theorem provers (running on different computers). The methodology is well-suited for realizing cooperation between different incarnations of one basic prover. Moreover, also different heterogeneous provers --that differ from each other in the calculus and in the heuristic they employ-- can be coupled. Cooperation between the different provers is achieved by periodically interchanging clauses which are selected by so-called referees. We present theoretic results regarding the completeness of the system of cooperating provers as well as describe concrete heuristics for designing referees. Furthermore, we report on two experimental studies performed with homogeneous and heterogeneous provers in the areas superposition and unfailing completion. The results reveal that the occurring synergetic effects lead to a significant improvement of performance. 2 1 INTRODUCTION 1 Introduction Although the aim of the CADE theorem prover...
- CiteSeerX — Citation Query Bridging theorem proving and mathematical knowledge retrieval
- CiteSeerX - Scientific documents that cite the following paper: Bridging theorem proving and mathematical knowledge retrieval
- Logic Programming with Failure as an Exception | Lambda the Ultimate
-
- Andl is a New Database Language | Lambda the Ultimate
-
- Sketchpad: A man-machine graphical communication system - UCAM-CL-TR-574.pdf
-
- [Haskell] Implicit parameters redux
-
- The Challenge Of Metaprogramming
-
- Laurence Tratt: Tail Call Optimization
-
- Reduction System -- from Wolfram MathWorld
-
- Gamasutra - From The Past To The Future: Tim Sweeney Talks
- In a special interview, Epic Games founder and technical guru Tim Sweeney discusses his career, from the company's birth in the shareware revolution through to present and future game technology challenges.
- Gamasutra - From The Past To The Future: Tim Sweeney Talks
- In a special interview, Epic Games founder and technical guru Tim Sweeney discusses his career, from the company's birth in the shareware revolution through to present and future game technology challenges.
- CiteSeerX — Citation Query Automatic construction of incremental LR(1) parsers
- CiteSeerX - Scientific documents that cite the following paper: Automatic construction of incremental LR(1) parsers
- William's bog-standard CS webpage
-
- Resource Aware ML
-
- [1405.3311] Beta Reduction is Invariant, Indeed (Long Version)
-
- Lightweight Semiformal Time Complexity Analysis for Purely Functional Data Structures
-
- Martini.pdf
-
- Research Papers of Manuel Chakravarty
-
- ML Modules and Haskell Type Classes: A Constructive Comparison | Lambda the Ultimate
-
- wg2.8-boston06.pdf
-
- The Big Mud Puddle: Why Concatenative Programming Matters
-
- Discuss the concatenative variety of computer languages: Joy, Forth, Postscript - Yahoo Groups
-
- Generalized Arrows are Multi Level Languages | Lambda the Ultimate
-
- A foundation for GADTs and inductive families
-
- LambdaCube 3D | Purely Functional Rendering Engine
- Purely Functional Rendering Engine
- Formal Methods Wiki - Wikia
- Formal Methods Wiki is a community site that anyone can contribute to. Discover, share and add your knowledge!
- [cmp-lg/9603001] Speech Recognition by Composition of Weighted Finite Automata
-
- Stuart M. Shieber's Publications
-
- Persistence and Upgrade
- E: Cryptographic Capabilities for Distributed Smart Contracting
- Welcome to ERights.Org
-
- CoqHoTT-minute : Ticking like a Clockwork: the New Coq Tactics
-
- CoqHoTT-minute
-
- sajith/cs-papers: Ye Olde Computer Science Scrolls!
- cs-papers - Ye Olde Computer Science Scrolls!
- fossacs072.pdf
-
- Polynomial Time Calculi - Schimanski_Stefan.pdf
-
- Type Systems for Resource Bounded Programming and Compilation
- Resource Bounded Computation Project
- asian03.pdf
-
- So you want to write a package manager — Medium
- You woke up this morning, rolled out of bed, and thought, “Y’know what? I don’t have enough misery and suffering in my l…
- Understanding F-Algebras - School of Haskell | School of Haskell
-
- A Lambda Calculus for Gödel–Dummett Logic Capturing Waitfreedom - Springer
-
- 我爱自然语言处理 | I Love Natural Language Processing
-
- The Dynamics of Judicial Proof: Computation, Logic, and Common Sense (Studies in Fuzziness and Soft Computing): Marilyn MacCrimmon, Peter Tillers: 9783790814590: Amazon.com: Books
- The Dynamics of Judicial Proof: Computation, Logic, and Common Sense (Studies in Fuzziness and Soft Computing) [Marilyn MacCrimmon, Peter Tillers] on Amazon.com. *FREE* shipping on qualifying offers. Fact finding in judicial proceedings is a dynamic process. This collection of papers considers whether computational methods or other formal logical methods developed in disciplines such as artificial intelligence
- Amazon.com: Judicial Applications of Artificial Intelligence (9780792354727): Giovanni Sartor, Luther Branting: Books
- Amazon.com: Judicial Applications of Artificial Intelligence (9780792354727): Giovanni Sartor, Luther Branting: Books
- lineartaste-revised.pdf
-
- Touhou Emoticons
-
- synthetic mathematics in nLab
-
- touhou icon heaven
- anordinarymagician said: I'd like some icons of Marisa for my blog. Answer: Sorry for the delay to everyone; the past few days I had visitors so I couldn’t do much. Anyway, Marisa’s also someone who I...
- Marina Meila's Home Page
- Marina Meila,
Department of Statistics, University of Washington
- Simula and Smalltalk: A Social and Political History
-
- The Structure of Scientific Revolutions - Wikipedia, the free encyclopedia
-
- short.pdf
-
- The Fastest and Shortest Algorithm for All Well-Defined Problems (Marcus Hutter)
- Homepage of Marcus Hutter containing Paper: The Fastest and Shortest Algorithm for All Well-Defined Problems
- Ranjit Jhala - Google Scholar Citations
-
- Scripts to Programs | PL Research, Racket, JavaScript, and more
- PL Research, Racket, JavaScript, and more (by Sam Tobin-Hochstadt)
- Google Scholar Citations
-
- Google Scholar Citations
-
- Rajeev Alur - Google Scholar Citations
-
- David Dill - Google Scholar Citations
-
- Olivier Coudert - Google Scholar Citations
-
- Generating compiler optimizations from proofs
-
- Handbook of Knowledge Representation (Foundations of Artificial Intelligence): Frank van Harmelen, Vladimir Lifschitz, Bruce Porter: 9780444522115: Amazon.com: Books
- Handbook of Knowledge Representation (Foundations of Artificial Intelligence) [Frank van Harmelen, Vladimir Lifschitz, Bruce Porter] on Amazon.com. *FREE* shipping on qualifying offers. Knowledge Representation, which lies at the core of Artificial Intelligence, is concerned with encoding knowledge on computers to enable systems to reason automatically. The Handbook of Knowledge Representation is an up-to-date review of twenty-five key topics in knowledge representation
- Engineering a Programming Language: The Type and Class System of Sather
-
- cav13.pdf
-
- stcsFinal.pdf
-
- Verified Transformations on Functional Programs Using the Higher-Order Abstract Syntax Approach
-
- Peter D Mosses, Computer Science, Swansea
-
- Christopher Strachey - Wikipedia, the free encyclopedia
-
- Action semantics - Wikipedia, the free encyclopedia
-
- Algebraic semantics (computer science) - Wikipedia, the free encyclopedia
-
- KeynotesSlidesmodularity2015.pdf
-
- J Home
-
- Kay Language
-
- Metakit embedded database library
-
- Ess And Kay Combinators
-
- Abstract Machines for Graph Reduction
-
- Easy.pdf
-
- LNCS 7211 - A Systematic Approach to Delimited Control with Multiple Prompts - systematic-multiple-control.pdf
-
- Classical logic, control calculi and data types - masterthesis.pdf
-
- paper.dvi - Cayenne.pdf
-
- RR-1030.pdf
-
- QuestManual.pdf
-
- Emina Torlak | publications
-
- ω-automaton - Wikipedia, the free encyclopedia
-
- Muller automaton - Wikipedia, the free encyclopedia
-
- lect4.pdf
-
- ALIG.dvi - safra.pdf
-
- Fangzhen Lin's Home Page
-
- Teaching logic with a proof assistant - Mathematics Educators Stack Exchange
-
- Lambda, the Ultimate TA - LambdaTA-ITP.pdf
-
- Lambda, the Ultimate TA - LambdaTA.pdf
-
- bkrw10a.pdf
-
- Kenneth McMillan - Microsoft Research
-
- Programming with Refinement Types
-
- Lamdu
- Lamdu : Lamdu - towards the next generation IDE
- ICFP 2012. Roly Perera: Functional Programs that Explain their Work. - YouTube
- ICFP 2012. Roly Perera: Functional Programs that Explain their Work.
- Pacific Northwest Scala 2013 We're Doing It All Wrong by Paul Phillips - YouTube
- My conclusion after moving a million lines of code is that everything we do (plus or minus) is wrong. Henry Ford said "If I had asked people what they wanted...
- Unison
-
- oplss-herbelin1.pdf
-
- Stephanie Weirich on Dependent Typing, Extending Haskell, Type System Research
- Stephanie Weirich gives an introduction to the ideas behind dependent typing, dependent typing in Haskell, extending Haskell, and the status and future of type theory.
- 678578.pdf
-
- Mercer's theorem - Wikipedia, the free encyclopedia
-
- Hilbert space - Wikipedia, the free encyclopedia
-
- Karhunen–Loève theorem - Wikipedia, the free encyclopedia
-
- Positive-definite matrix - Wikipedia, the free encyclopedia
-
- Lp space - Wikipedia, the free encyclopedia
-
- Eigenfunction - Wikipedia, the free encyclopedia
-
- Orthonormal basis - Wikipedia, the free encyclopedia
-
- Spectral theory of compact operators - Wikipedia, the free encyclopedia
-
- Equicontinuity - Wikipedia, the free encyclopedia
-
- Arzelà–Ascoli theorem - Wikipedia, the free encyclopedia
-
- Spectral theorem - Wikipedia, the free encyclopedia
-
- Kernel method - Wikipedia, the free encyclopedia
-
- Representer theorem - Wikipedia, the free encyclopedia
-
- Spectral theory - Wikipedia, the free encyclopedia
-
- Mercer's condition - Wikipedia, the free encyclopedia
-
- jovanovic-fmsd2012.pdf
-
- 3. Natural deduction proofs | Logic Matters
-
- An Introduction to Gödel's Theorems | Logic | Cambridge University Press
- A clear and accessible treatment of Gödel's famous, intriguing, but much misunderstood incompleteness theorems, extensively revised in a second edition.
- crow2016.pdf
-
- prprfrp.pdf
-
- Pointcuts and Advice in Higher-Order Languages
-
- The Big Bang Theory of IDEs - ACM Queue
-
- New SPARK Book
- Altran Website
- F-ing Modules
- Be declarative. Be functional. Just be.
- Parametric HOAS with first-class modules | Syntax!
- One of the first choice to make when starting the development of a compiler, or any program manipulating syntax with binders (e.g. programs with functions and variables), is how to represent these terms. Some specialized programming languages, like Beluga, have built-in facilities for this. But if you choose a general-purpose one, like OCaml, then you have plenty…
- In Memorium, Robert Paige
-
- Program transformation - Wikipedia, the free encyclopedia
-
- dotguide.pdf
-
- biernacki-polesiuk-TLCA15.pdf
-
- Danko Ilik - Formalization
-
- [0904.0071] Kripke Models for Classical Logic
-
- [1102.1061] Continuation-passing Style Models Complete for Intuitionistic Logic
-
- [1210.2094] Type Directed Partial Evaluation for Level-1 Shift and Reset
-
- Logical relations for coherence of effect subtyping
-
- Leslie Lamport's Home Page
-
- http://conal.net/papers/icfp97/
-
- Retrospective: The Essence of Compiling with Continuations | Lambda the Ultimate
-
- atzeus/FRPNow
- Contribute to FRPNow development by creating an account on GitHub.
- icfp97.dvi - icfp97.pdf
-
- Rtac: Reflective Tactics in Coq | Gregory Malecha
- I do research on programming languages, program verification, compilers, and program analysis.
- The Core of Computational Reflection | Gregory Malecha
- I do research on programming languages, program verification, compilers, and program analysis.
- gmalecha/template-coq: Reflection library for Coq
- template-coq - Reflection library for Coq
- Extensible and Efficient Automation through Reflective Tactics | Gregory Malecha
- I do research on programming languages, program verification, compilers, and program analysis.
- Towards Verification of Hybrid Systems in a Foundational Proof Assistant | Gregory Malecha
- I do research on programming languages, program verification, compilers, and program analysis.
- Extensible Proof Engineering in Intensional Type Theory | Gregory Malecha
- I do research on programming languages, program verification, compilers, and program analysis.
- Semantics of Type Theory - Springer
-
- theses.fr – Guilhem Jaber , A logical study of program equivalence
- Prouver l’équivalence de programmes écrits dans un langage fonctionnel avec références est un problème notoirement difficile. L’objectif de cette thèse est de proposer un système logique dans lequel de telles preuves peuvent être formalisées, et dans certains cas inférées automatiquement. Dans la première partie, une méthode générique d’extension de la théorie des types dépendants est proposée, basée sur une interprétation du forcing vu comme une traduction de préfaisceaux de la théorie des types. Cette extension dote la théorie des types de constructions récursives gardées, qui sont utilisées ensuite pour raisonner sur les références d’ordre supérieure. Dans une deuxième partie, nous définissons une sémantique des jeux nominale opérationnelle pour un langage avec références d’ordre supérieur. Elle marie la structure catégorique de la sémantique des jeux avec une représentation sous forme de traces de la dénotation des programmes, qui se calcule de manière opérationnelle et dispose donc de bonnes propriétés de modularité. Cette sémantique nous permet ensuite de prouver la complétude de relations logiques à la Kripke définit de manière directe, via l’utilisation de types récursifs gardés, sans utilisation de la biorthogonalité. Une telle définition directe nécessite l’utilisation de mondes omniscient et un contrôle fin des locations divulguées. Finalement, nous introduisons une logique temporelle qui donne un cadre pour définir ces relations logiques à la Kripke. Nous ramenons alors le problème de l’équivalence contextuelle à la satisfiabilité d’une formule de cette logique générée automatique, c’est à dire à l’existence d’un monde validant cette formule. Sous certaines conditions, cette satisfiabilité peut être décidée via l’utilisation d’un solveur SMT. La complétude de notre méthode devrait permettre d’obtenir des résultats de décidabilité pour l’équivalence contextuelle de certains fragment du langage considéré, en fournissant un algorithme pour construire de tels mondes.
- Future Programming Workshop
-
- Viewpoints Research Institute
-
- tr2007008_steps.pdf
-
- pigworker/CS410-14: being the materials for CS410 Advanced Functional Programming in the 2014-15 session
- CS410-14 - being the materials for CS410 Advanced Functional Programming in the 2014-15 session
- Tutorials - The Twelf Project
-
- CiteSeerX — A Framework for Defining Logics
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus with dependent types. Syntax is treated in a style similar to, but more general than, Martin-Lof's system of arities. The treatment of rules and proofs focuses on his notion of a judgement. Logics are represented in LF via a new principle, the judgements as types principle, whereby each judgement is identified with the type of its proofs. This allows for a smooth treatment of discharge and variable occurrence conditions and leads to a uniform treatment of rules and proofs whereby rules are viewed as proofs of higher-order judgements and proof checking is reduced to type checking. The practical benefit of our treatment of formal systems is that logic-independent tools such as proof editors and proof checkers can be constructed.
- seplogic.pdf
-
- 15-819A Srping 2000 Description
-
- 15-317 Constructive Logic
- Constructive Logic
- 15-816 Linear Logic
- Linear Logic
- 15-816 Modal Logic
- Modal Logic
- Foundations of Illocutionary Logic - John R. Searle, Daniel Vanderveken - Google Books
- This is a formal and systematic study of the logical foundations of speech act theory. The study of speech acts has been a flourishing branch of the philosophy of language and linguistics over the last two decades, and John Searle has of course himself made some of the most notable contributions to that study in the sequence of books Speech Acts (1969), Expression and Meaning (1979) and Intentionality (1983). In collaboration with Daniel Vanderveken he now presents the first formalised logic of a general theory of speech acts, dealing with such things as the nature of an illocutionary force, the logical form of its components, and the conditions of success of elementary illocutionary acts. The central chapters present a systematic exposition of the axioms and general laws of illocutionary logic.
- 05_Searle_vanderveken.pdf
-
- minicourse4.pdf
-
- 002.pdf
-
- Introduction to annotated logics : foundations for paracomplete and paraconsistent reasoning (eBook, 2015) [WorldCat.org]
- Get this from a library! Introduction to annotated logics : foundations for paracomplete and paraconsistent reasoning. [Jair Minoro Abe; Seiki Akama; Kazumi Nakamatsu] -- This book is written as an introduction to annotated logics. It provides logical foundations for annotated logics, discusses some interesting applications of these logics and also includes the ...
- [math/0305282] A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
-
- Wirth_Design.pdf
-
- asyncdoc.pdf
-
- Asynchronous Proof Processing with Isabelle/Scala and Isabelle/jEdit
-
- CiteSeerX — Managing proof documents for asynchronous processing
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Asynchronous proof processing is a recent approach at improving the usability and performance of interactive theorem provers. It builds on a simple metaphor: the user edits a proof document while the prover checks its consistency in the background without explicit requests from the user. This paper presents a software architecture for asynchronous proof processing. Its foundation is a novel state model for commands that synchronizes the possibly parallel accesses of the user interface and prover. The state model is complemented by a communication protocol that places minimal requirements on the prover. The model also allows asynchronous processing to be emulated by existing linear-processing proof engines, such that the migration to the new communication protocol is simplified. A prototype implementation that works with the current development version of Isabelle is presented.
- Tips For Writing Pattern Languages
-
- nancy.pdf
-
- yesno: Classical semantics
-
- yesno: Inconsistent semantics
-
- undergrad-thesis-report.pdf
-
- Tacit programming - Wikipedia, the free encyclopedia
-
- dmbarbour | Lambda the Ultimate
-
- Fine, make me a blog - My Re-thinking of Literate Programming
- My Re-thinking of Literate Programming As long as I can remember, I wanted to be an author. So the legend goes, when I was born, the delivery room (mom, dad, grandmas, grandpas, aunts, uncles) all...
- op07-perera.pdf
-
- Persistent data structure - Wikipedia, the free encyclopedia
-
- Retroactive data structures
-
- Coccinelle: A Program Matching and Transformation Tool for Systems Code
-
- Conal Elliott » Paper: Beautiful differentiation
-
- Java Community News - Donald Knuth on Multi-Core, Unit Testing, Literate Programming, and XP
-
- The grand unified theory of software engineering - Google Books
-
- icfp066-liu.dvi - icfp066-liu.pdf
-
- Programming and Computation
- A collection of articles on expressing and reasoning about computation.
- Tutorial: a Hello World in Coq
-
- Do-it-yourself type theory - Springer
-
- Christos Papadimitriou - Wikipedia, the free encyclopedia
-
- First-Order Logic as a Constraint Programming Language - Springer
-
- Actor Model of Computation for Scalable Robust Information Systems
- The Actor Model is a mathematical theory that treats “Actors” as the universal conceptual primitives of digital computation.
Hypothesis: All physically possible computation can be directly implemented using Actors.
The model has been used both as a framework for a theoretical understanding of concurrency, and as the theoretical basis for several practical implementations of concurrent systems. The advent of massive concurrency through client-cloud computing and many-core computer architectures has galvanized interest in the Actor Model.
Message passing using types is the foundation of system communication:
•Messages are the unit of communication
•Types enable secure communication with any Actor
When an Actor receives a message, it can concurrently:
•send messages to (unforgeable) addresses of Actors that it has;
•create new Actors;
•for an exclusive Actor, designate how to handle the next message it receives.
- ActorScript™ extension of C#®, Java®, Objective C®, JavaScript®, and SystemVerilog using iAdaptive™ concurrency for antiCloud™ privacy and security
- ActorScript(TM) is a general purpose programming language for efficiently implementing robust applications (with no single point of failure) using discretionary, adaptive concurrency that manages resources and demand.
It is differentiated from previous languages by the following:
- Universality
* Ability to specify what Actors can do
* Specify interface between hardware and software
* Everything in the language is accomplished using message passing including the very definition of ActorScript itself
* Functional, Imperative, Logic, and Concurrent programming are integrated.
* Concurrency dynamically adapts to resources available and current load.
* Programs do not expose low-level implementation mechanisms such as threads, tasks, locks, cores, etc.
* Messages can be directly communicated without requiring indirection through brokers, channels, class hierarchies, mailboxes, pipes, ports, queues etc.
* Variable races are eliminated.
* Binary XML and JSON are data types.
* Application binary interfaces are afforded so that no identifier symbol need be looked up at runtime.
- Safety and Security
* Programs are extension invariant, i.e., extending a program does not change its meaning.
* Applications cannot directly harm each other.
- Performance
* Impose no overhead on implementation of Actor systems
* Message passing has essentially same overhead as procedure calling and looping.
* Allow execution to be dynamically adjusted for system load and capacity (e.g. cores)
* Locality because execution is not bound by a sequential global memory model
* Inherent concurrency because execution is not bound by communicating sequential processes
* Minimize latency along critical paths
- Haskell is easy
-
- "Controlling Time and Space: understanding the many formulations of FRP" by Evan Czaplicki - YouTube
- Functional Reactive Programming (FRP) is becoming an increasingly common way to structure event- driven code, but the term "FRP" actually refers to a large b...
- Adapton: Composable, Demand-Driven Incremental Computation
-
- Programming with Managed Time - Microsoft Research
-
- Controlling Time and Space by Evan Czaplicki on Prezi
-
- The Perfect Language | Articles | Inference: International Review of Science
- Mathematicians still believe in absolute truth and formal proof, though Gödel and Turing showed that no axiomatic theory includes all mathematical truths. Algorithmic information theory confirms this. Gregory Chaitin explores incompleteness and uncomputability, and reflects on his work in AIT.
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- Programming and Programming Languages
-
- Hack
-
- repair.dvi - repair.pdf
-
- Factor programming language
-
- Factor: an extensible interactive language - YouTube
- Google Tech Talks October 27, 2008 ABSTRACT Factor is a general-purpose programming language which has been in development for a little over five years and i...
- Zed Shaw - The ACL is Dead on Vimeo
- Slides (instructions extracted from http://www.zedshaw.com/conferences/cusec2008.html): Zed did his presentation in Factor (http://factorcode.org) using a presentation…
- 0812.4852.pdf
-
- fogus: Programming language development: the past 5 years
- Pseudo-random ramblings from Fogus.
- fogus: The Devil’s Programming Glossary: Rubris
- Pseudo-random ramblings from Fogus.
- fogus: 10 Technical Papers Every Programmer Should Read (At Least Twice)
- Pseudo-random ramblings from Fogus.
- fogus: Become Obsolete
- Pseudo-random ramblings from Fogus.
- fogus: My favorite interview question
- Pseudo-random ramblings from Fogus.
- fogus: Predicate Dispatch…
- Pseudo-random ramblings from Fogus.
- fogus: Pattern Matching vs. Destructuring… to the death!
- Pseudo-random ramblings from Fogus.
- ASE98 minitutorial-2002.ppt - cat101.pdf
-
- About
- Functional Programming, System Softwares, Web Programming, and more
- Projects
- Functional Programming, System Softwares, Web Programming, and more
- Lambda LF
- This post is about implementation of a simple dependently typing language called lambda LF, based on Advanced Topics in Types and Programming Languages.
- Implementation and Analysis of Template Lambda Calculus
- This implementation is based on theory behind Template Haskell [1].
- Implementation of Linear Type System in Haskell
- This implementation is based on Advanced Topics in Types and Programming Languages
- Implementation of "Principal type-schemes for functional programs" in Haskell
- Basics
- Booklist
- Some books I have read and like.
- MIT unifies Web dev into a single, speedy new language -- Ur/Web | Computerworld
- Ur/Web allows developers to write pages as self-contained programs
- Yesod Web Framework for Haskell
- Yesod is a Haskell web framework for productive development of type-safe, RESTful, high performance web applications.
- Implementing Delimited Control
- Techniques for implementing and emulating delimited control in various language systems
- Continuations and delimited control
- A collection of articles on delimited and undelimited
continuations and context-passing programming.
- caml-shift.pdf
-
- [Haskell] Three new implementations of multi-prompt delimited control
-
- http://www.jot.fm/issues/issue_2003_05/column1/
-
- ETH - Oberon - Welcome to Oberon
- ETH Zuerich
- Research Projects
-
- Computer Science – Theory and Applications - Springer
-
- vWeA2003-Esther.pdf
-
- CiteSeerX — Near-concrete program interpretation
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract. We develop a near-concrete interpretation, a program analysis that aims to cut very close to program execution while retaining interpretation, but models heaps with possibly recursive strucure, is path sensitive, and applies in a fully higher-order setting. The main technical contribution is a prune-rerun technique for analyzing higherorder recursive functions. To illustrate the expressiveness and usefulness of the system, we show how it can be used to enforce temporal program safety properties and information flow security, and show how it betters state-of-the-art systems on some examples. 1
- algebras-ecoop15.pdf
-
- multi-type-deak.pdf
-
- The display calculus and conservativity for substructural logics - Revantha Ramanayake.pdf
-
- An introduction to the display calculus - Tbilisi-summer-school-2013.pdf
-
- Display logic - 87displaylogic.pdf
-
- Theory and Logic Group | Theory and Logic Group
-
- Gödel (programming language) - Wikipedia, the free encyclopedia
-
- Software Architecture Group (HPI) - Home
-
- COLA and Open, extensible object models | Lambda the Ultimate
-
- Amazon.com: Descartes' Dream: The World According to Mathematics (9780395431542): Philip J. Davis, Reuben Hersh: Books
- Amazon.com: Descartes' Dream: The World According to Mathematics (9780395431542): Philip J. Davis, Reuben Hersh: Books
- [1307.2004] Imperative Programs as Proofs via Game Semantics
-
- views.pdf
-
- nwpt97-peas.pdf
-
- Index of /afs/cs/project/ai-repository/ai
-
- Re: Paul Graham's PyCon Keynote
-
- Downwardly Scalable Systems
-
- display.pdf
-
- Embedding the hypersequent calculus in the display calculus
-
- comparingmodal.pdf
-
- download
-
- Logical Methods in Computer Science
-
- markm-thesis.pdf
-
- Encoding Information Flow in Haskell | Lambda the Ultimate
-
- The JoCaml system
-
- Functional Nets
-
- ConscientiousSoftwareCC.pdf
-
- fogus: In the Shadow of John McCarthy
- Pseudo-random ramblings from Fogus.
- Prolog and Logic Programming
- A collection of Prolog code and notes on logic programming
- Embedding Prolog in Haskell | Lambda the Ultimate
-
- Prolog and Logic Programming
- A collection of Prolog code and notes on logic programming
- Typed syntactic meta-programming
-
- Scheme Programming
- An archive of Scheme code
- Samuel R. Buss: Home page
-
- Moshe Y. Vardi's Home Page
-
- [1508.06576] A Neural Algorithm of Artistic Style
-
- Emily Short's Interactive Storytelling | Essays and reviews on narrative in games and new media
- Essays and reviews on narrative in games and new media (by Vicarious Traveler)
- era/tenerezza.txt at ca8ba75ea4375e19600c8944fdd8434f6f8cad87 · rocketnia/era
- era - A programming system with selective encapsulation and a metaprogramming focus.
- era/tenerezza-macros.txt at ca8ba75ea4375e19600c8944fdd8434f6f8cad87 · rocketnia/era
- era - A programming system with selective encapsulation and a metaprogramming focus.
- Tenerezza Underway | Pipe Dreams
- Over the past couple of weeks, I've ironed out most of the design for both the Tenerezza core language and a convenient Lisp-like macro layer. Tenerezza Tenerezza is distinguished from mainstream languages in a few ways: Tenerezza is an untyped language where all values are distinguished by sealer/unsealer tags. Even function closures are unencapsulated to…
- RKN, Constant Time Steps, and Other Adventures | Pipe Dreams
- It's been a couple of years since I posted here! Somehow 2014 turned into an opportunity for me to practice forms of expression other than programming, but that's not what I'm here to talk about. I still spent lots of time on language design throughout 2014, and I've been zooming along in the new year. Ethics for language…
- An extensible type system for meaning-preserving modularity | Pipe Dreams
- I'm gradually figuring out a foundation for a general-purpose programming language, and I think I just laid a great cornerstone, which seems to solve the expression problem for dependent type theory. My pseudocode is in this long GitHub Gist, which comes with a long revision history showing my progress over the last 12 days. I haven't yet…
- Reactive Knowledge Networking | Pipe Dreams
- On December 20, just in time for the Mayan apocalypse, I thought of an approach to computer programming that unites my meaning-preserving modularity, some of David Barbour's RDP vision, and my own philosophical worldview. I'm calling it Reactive Knowledge Networking. It takes the philosophical idea that a person does nothing with the world except observation and…
- Meaning-preserving modularity | Pipe Dreams
- Sharing code is like sharing knowledge---the knowledge of how to write that code. I think we can simplify the meaning of program imports by making them queries to an oracle of all possible shared code. This frees us from some complexity in maintaining the modules installed in a system: The modules' effects on what the…
- A Language Should Support the Future | Pipe Dreams
- There's one design goal of Arc I find completely self-evident. Arc's designed for good programmers. Duh. Programmers in the future will be better than us, because they'll be capable of observing our mistakes. If a language doesn't target good programmers, it doesn't have a very bright future. There's way more to this concept than than…
- A Language Should Target Moving Platforms | Pipe Dreams
- Platforms are not languages to me. Languages don't deal with security, file operations, threads, and so on. Languages are syntaxes people use to develop tools on platforms. Platforms stack, vaguely. The LAMP stack is a classic example: The server is Linux running Apache, content-specific sub-platforms are developed on top of PHP or Perl for Apache…
- rose2.pdf
-
- Wormholes: Introducing Effects to FRP | The Yale Haskell Group
-
- popl074-krishnaswami.pdf
-
- DE95.dvi - download
-
- Breaking down FRP :: Jane Street Tech Blogs
-
- Dan Grossman's Presentations
- Dan Grossman, University of Washington, Presentations
- logic-tools/sml-handbook: SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too
- sml-handbook - SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too
- Zélus: A Synchronous Language with ODEs - hscc13.pdf
-
- Zélus: publications
- Publications about Zélus.
- Zélus: a hybrid synchronous language with ODEs
- Program embedded software and its physical environment
inside the same language.
- Zélus: examples
- Example programs written in Zélus.
- Freer Monads and Extensible Effects
- Framework for modular combination of effects based on Cartwright and Felleisen's idea of effects as interaction, augmented with types and effect encapsulation
- extensible-effects: An Alternative to Monad Transformers | Hackage
-
- lvars-fhpc13.pdf
-
- habit-report-Nov2010.pdf
-
- HASP Homepage
-
- Memoization in Rust? - help - The Rust Programming Language Forum
- I'm trying to pass a mutable hashmap to a function which calls itself recursively. Any help getting this working would be much appreciated, or if you could just show an example of memoization in Rust, that would help. …
- chll.pdf
-
- lect3.pdf
-
- ifl07-paper.pdf
-
- Linear types for aliased resources - Microsoft Research
-
- padl05.pdf
-
- C:\cygwin\home\greg\cyclone_internal\nu-alias\tlca05.ps - tlca05.pdf
-
- essay.pdf
-
- CiteSeerX — A Tutorial on (Co)Algebras and (Co)Induction
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): . Algebraic structures which are generated by a collection of constructors--- like natural numbers (generated by a zero and a successor) or finite lists and trees--- are of well-established importance in computer science. Formally, they are initial algebras. Induction is used both as a definition principle, and as a proof principle for such structures. But there are also important dual "coalgebraic" structures, which do not come equipped with constructor operations but with what are sometimes called "destructor" operations (also called observers, accessors, transition maps, or mutators). Spaces of infinite data (including, for example, infinite lists, and non-well-founded sets) are generally of this kind. In general, dynamical systems with a hidden, black-box state space, to which a user only has limited access via specified (observer or mutator) operations, are coalgebras of various kinds. Such coalgebraic systems are common in computer science. And "coinduction" is the appropriate te...
- Neil Mitchell's Haskell Blog: Three Space Leaks
-
- Neil Mitchell's Haskell Blog: Detecting Space Leaks
-
- Neil Mitchell's Haskell Blog: Testing is never enough
-
- Neil Mitchell's Haskell Blog
-
- Neil Mitchell's Haskell Blog
-
- Neil Mitchell's Haskell Blog
-
- Neil Mitchell's Haskell Blog
-
- Neil Mitchell's Haskell Blog
-
- Neil Mitchell's Haskell Blog
-
- Interactive Programming
-
- Usability Issues in the Design of Novice Programming Systems
-
- The Implementation of Functional Programming Languages
-
- plmw15.pptx - plmw15.pdf
-
- OutSystems Blog » Visual Programming Is Unbelievable… Here’s Why We Don’t Believe In It
-
- Flow-based Programming
- Official website for flow-based programming
- Escher syntax
-
- Structure Editors for Wikilon | Awelon Blue
- I have a new design that vastly improves upon my older extensible syntax and embedded literal objects approaches, and brings Wikilon many steps closer to my long term HCI goals for Awelon project. And it's surprisingly simple! Every word in the Wikilon dictionary is now defined by a pair: a compiler function, and a structured…
- seplogic.pdf
-
- Rosette - publications
-
- The Rosette Guide
-
- Rosette - applications
-
- Programming Achievements: How to Level Up as a Developer
- Jason Rudolph - Programmer, consultant, speaker, and author specializing in Ruby, Rails, and Clojure
- The Bipolar Lisp Programmer
-
- Frink
- A practical calculating tool, unit
conversion utility, and programming language designed to make physical
calculations simple. It tracks units of measure (feet, meters, kilograms,
watts, etc.) through all calculations, and helps ensure that answers are
correct.
- Shen
-
- Alex Aiken
-
- The Craft of Programming
-
- Theories of Programming Languages
-
- theotypestr.pdf
-
- From Set Theory to Type Theory | The n-Category Café
-
- EssenceOfReynolds-preprint.pdf
-
- Polymorphism is not set-theoretic - document
-
- pitts-polymorphism-is-set-theoretic-constructively.pdf
-
- poster2009-agda.indd - 2009abstractionposter.pdf
-
- ezyang's research log
- What I did today. High volume, low context. Sometimes nonsense. (Archive)
- f-in-coq.pdf
-
- download
-
- Parametricity - Wikipedia, the free encyclopedia
-
- logical-relations-and-parametricity.pdf
-
- dblp: John C. Reynolds
- List of computer science publications by John C. Reynolds.
- thesis_revised.pdf
-
- type theory - Where is relational parametricity in hyperdoctrine or topos models explored? - Theoretical Computer Science Stack Exchange
-
- O-JDahl.pdf
-
- Papers and Presentations · sean-parent/sean-parent.github.io Wiki
- Contribute to sean-parent.github.io development by creating an account on GitHub.
- xleroy-modular_modules-jfp.pdf
-
- 大灾变: 劫后余生
-
- Rationality: From AI to Zombies - Machine Intelligence Research Institute
-
- A Higher-Order Calculus for Categories
- A Higher-Order Calculus for Categories
- Category theory - HaskellWiki
-
- paper.dvi - superposition-extended.pdf
-
- lo.logic - What is lambda calculus related to? - MathOverflow
-
- Resources for learning practical category theory - MathOverflow
-
- The Self Handbook — Self Handbook for Self 4.5.0 documentation
-
- Formulae-as-Types Correspondence for Classical Logic
-
- consequently.org: Greg Restall’s website
-
- minimal logic in nLab
-
- Vladimir Vasyukov
- Vladimir Vasyukov
- Sergei P. Odintsov {home page}
-
- main.dvi - download
-
- 24 Days of GHC Extensions: Static Pointers
-
- CiteSeerX — Template-based Program Verification and Program Synthesis
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Program verification is the task of automatically generating proofs for a program’s compliance with a given specification. Program synthesis is the task of automatically generating a program that meets a given specification. Both program verification and program synthesis can be viewed as search problems, for proofs and programs, respectively. For these search problems, we present approaches based on user-provided insights in the form of templates. Templates are hints about the syntactic forms of the invariants and programs, and help guide the search for solutions. We show how to reduce the template-based search problem to satisfiability solving, which permits the use of off-the-shelf solvers to efficiently explore the search space. Template-based approaches have allowed us to verify and synthesize programs outside the abilities of previous verifiers and synthesizers. Our approach can verify and synthesize difficult algorithmic textbook programs (e.g., sorting, and dynamic programming-based algorithms, etc.), and difficult arithmetic programs.
- Simon Peyton Jones: Beautiful concurrency | Lambda the Ultimate
-
- Beautiful Code: Leading Programmers Explain How They Think (Theory in Practice (O'Reilly)): Andy Oram, Greg Wilson: 9780596510046: Amazon.com: Books
- Beautiful Code: Leading Programmers Explain How They Think (Theory in Practice (O'Reilly)) [Andy Oram, Greg Wilson] on Amazon.com. *FREE* shipping on qualifying offers. How do the experts solve difficult problems in software development? In this unique and insightful book
- [1505.00387] Highway Networks
-
- () - 1209.6336.pdf
-
- scmmach.dvi - icfp99-ffkf.pdf
-
- Microsoft Word - Liveness-v-may-16-corrected.docx - Liveness2013.pdf
-
- Programming the Greedy CAM Machine - Microsoft Research
-
- "Ranjit Jhala" - Google Scholar
-
- where-clauses.pdf
-
- ADAPTIVE SOFTWARE
-
- Metamorphic Programming
-
- LtU Classic Archives
-
- Do we Need Dependent Types?
- Do we Need Dependent Types?
- gibbons-slides.pdf
-
- CategoricalADT_AMAST98.pdf
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- SLAM - Microsoft Research
- SLAM is a project for checking that software satisfies critical behavioral properties of the interfaces it uses and to aid software engineers in designing interfaces and software that ensure reliable and correct functioning. Static Driver Verifier that is a part of Windows WDK (Driver Development Kit) is based on the SLAM verification engine.
- overviewProofTheoryTypeTheory2004.pdf
-
- LtU Classic Archives
-
- mathfit00.dvi - mathfit00.pdf
-
- Graham Hutton: Publications
-
- icalp03.pdf
-
- towards.pdf
-
- abs-view.pdf
-
- a.dvi - short.pdf
-
- icfp02.pdf
-
- download
-
- AlanTuring.net What is AI? Part 11
-
- Nouvelle AI
- Nouvelle AI
- Reactive planning and nouvelle AI
-
- coordinated-concurrent-programming-in-syndicate-20160111-1409.pdf
-
- 50ページ目 「ジョジョのきみょんな東方」の画像投稿作品の検索 [pixiv]
- pixiv is an online artist community where members can browse and submit works, join official contests, and collaborate on works with other members.
- MacTech | The journal of Apple technology.
-
- MacTech | The journal of Apple technology.
-
- WhyOfY.fm - WhyOfY.pdf
-
- A type system equivalent to a model checker
-
- kilpatrick-masters-thesis.pdf
-
- multipoly.pdf
-
- CSP is a retract of CCS
-
- 华东师范大学 何积丰
- 华东师范大学 何积丰
- A Dataflow Syntax Sketch | Pipe Dreams
- Recently I find it compelling to view programs in terms of their dataflow, since sometimes the whole dataflow graph can be generalized to some other purpose. I think it could be interesting to have a lisp variant whose surface syntax was not a tree but instead a dataflow graph. Last post, I described this train of thought in more…
- Generalizing Expressions as Dataflow | Pipe Dreams
- Reactive programming and dependent typing have opened my eyes to an interesting way to view syntax. Now if you'll bear with me, I won't get to syntax until the end of the post. In programming languages we often build "data" out of sums (either this kind of thing or that kind of thing) and products (this kind of thing…
- 1502.04623.pdf
-
- %!PS-Adobe-3.0 - download
-
- untitled - rosu-2006-icfp.pdf
-
- Compactness theorem - Wikipedia, the free encyclopedia
-
- Forcing (mathematics) - Wikipedia, the free encyclopedia
-
- Borel hierarchy - Wikipedia, the free encyclopedia
-
- Borel set - Wikipedia, the free encyclopedia
-
- Polish space - Wikipedia, the free encyclopedia
-
- Transfinite induction - Wikipedia, the free encyclopedia
-
- Second-order arithmetic - Wikipedia, the free encyclopedia
-
- A Differential Approach to Undefined Behavior Detection | March 2016 | Communications of the ACM
-
- Forcing (recursion theory) - Wikipedia, the free encyclopedia
-
- Polynomial hierarchy - Wikipedia, the free encyclopedia
-
- Turing jump - Wikipedia, the free encyclopedia
-
- Many-one reduction - Wikipedia, the free encyclopedia
-
- Post's theorem - Wikipedia, the free encyclopedia
-
- Interpretability logic - Wikipedia, the free encyclopedia
-
- Turing reduction - Wikipedia, the free encyclopedia
-
- Hyperarithmetical theory - Wikipedia, the free encyclopedia
-
- Effective descriptive set theory - Wikipedia, the free encyclopedia
-
- Analytical hierarchy - Wikipedia, the free encyclopedia
-
- Who Can Name the Bigger Number?
-
- iprogs.pdf
-
- () - 0910.1268.pdf
-
- ECOOP 2016
-
- tlca01.pdf
-
- science.mathematics.logic.coq.club - Re: eta-reduction in the convertibility rule of Coq - msg#00014 - Recent Discussion OSDir.com
-
- SWIN: Towards Type-Safe Java Program Adaptation between APIs - Semantic Scholar
- An academic search engine that utilizes artificial intelligence methods to provide highly relevant results and novel tools to filter them with ease.
- SWIN
-
- fogus: The best things and stuff of 2012
- Pseudo-random ramblings from Fogus.
- fogus: Structure editing a-go-go with Nokolisp
- Pseudo-random ramblings from Fogus.
- fogus: Minimum Viable Snippet
- Pseudo-random ramblings from Fogus.
- fogus: 0th-world Problems
- Pseudo-random ramblings from Fogus.
- fogus: Not enough
- Pseudo-random ramblings from Fogus.
- fogus: Why I Don’t Post “Why I Don’t ___” Posts
- Pseudo-random ramblings from Fogus.
- fogus: Resolutionationism
- Pseudo-random ramblings from Fogus.
- fogus: Dancing monkey gibbers on about macros and such…
- Pseudo-random ramblings from Fogus.
- main.dvi - jshutt.pdf
-
- First class environments - Rosetta Code
-
- John C. Mitchell Publications
-
- PicoLisp FAQ
-
- radical.pdf
-
- First-class environments. Discuss. ;) | Lambda the Ultimate
-
- Extending the Scope of Syntactic Abstraction | Lambda the Ultimate
-
- LtU Classic Archives
-
- INDEX of Papers
-
- The Little Calculist: Fexprs? in Scheme?
-
- [1601.05520] COGENT: Certified Compilation for a Functional Systems Language
-
- fetscher-phd.pdf
-
- esop16-short.pdf
-
- gradual-recursive.pdf
-
- Guard: Semi-automated mathematics - Google Scholar
-
- Rippling: Meta-Level Guidance for Mathematical Reasoning - Alan Bundy - Google Books
- Rippling is a radically new technique for the automation of mathematical reasoning. It is widely applicable whenever a goal is to be proved from one or more syntactically similar givens. It was originally developed for inductive proofs, where the goal was the induction conclusion and the givens were the induction hypotheses. It has proved to be applicable to a much wider class of tasks, from summing series via analysis to general equational reasoning. The application to induction has especially important practical implications in the building of dependable IT systems, and provides solutions to issues such as the problem of combinatorial explosion. Rippling is the first of many new search control techniques based on formula annotation; some additional annotated reasoning techniques are also described here. This systematic and comprehensive introduction to rippling, and to the wider subject of automated inductive theorem proving, will be welcomed by researchers and graduate students alike.
- Logic and program analysis | Continuation
-
- Experiments with Roo, a parallel automated deduction system - Springer
-
- phdthe.dvi - 00b49530653fdc6c92000000.pdf
-
- hoatp.dvi - Kohlhase-hoatp98.pdf
-
- 6_Maric2ab.dvi - zrn26p173-223.pdf
-
- atp17.pdf
-
- p49-guard.pdf
-
- A man-machine theorem-proving system
-
- HOPL2-Uncut.pdf
-
- Newell_Simon_Heuristic_Problem_Solving_1958.pdf
-
- GPS and Decision Making: An Overview - Springer
-
- Stating Problems as Procedures to a General Problem Solving Program - Springer
-
- CiteSeerX — Citation Query The search for generality
- CiteSeerX - Scientific documents that cite the following paper: The search for generality
- aces-a-cartographic-expert-system.pdf
-
- Reverse mathematics - Wikipedia, the free encyclopedia
-
- Game Programming Patterns
-
- Concrete Semantics
-
- Galois.pdf
-
- [1411.3962] Galois Transformers and Modular Abstract Interpreters
-
- Galois connection - Wikipedia, the free encyclopedia
-
- Monads Made Difficult
- {{description}}
- Combining computational effects | Lambda the Ultimate
-
- Implicit phasing for R6RS libraries
-
- OdySci: POPL paper search
-
- CiteSeerX — An Idealized MetaML: Simpler, and More Expressive
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): MetaML is a multi-stage functional programming language featuring three constructs that can be viewed as statically-typed refinements of the back-quote, comma, and eval of Scheme. Thus it provides special support for writing code generators and serves as a semantically sound basis for systems involving multiple interdependent computational stages. In previous work, we reported on an implementation of MetaML, and on a small-step semantics and type-system for MetaML. In this paper, we present An Idealized MetaML (AIM) that is the result of our study of a categorical model for MetaML. An important outstanding problem is finding a type system that provides the user with a means for manipulating both open and closed code. This problem has eluded efforts by us and other researchers for over three years. AIM solves the issue by providing two type constructors, one classifies closed code and the other open code, and describing how they interact.
- Programming pearls
-
- William S. Burroughs Cut-ups
-
- An oracle for object-oriented programmers | MIT News
- By automatically cataloging connections between software 'objects,' a new system orients programmers joining large software projects in midstream.
- Laurence Tratt: Parsing: The Solved Problem That Isn't
-
- LLVM Developers Mailing List
-
- Paul Vick: Language Design & Paying the UI "Tax" | Lambda the Ultimate
-
- appel-ec2-08.pdf
-
- implicit-phasing.pdf
-
- Kent M Pitman: Climate: Overview
-
- ACM Lisp Pointers V, 4 (Oct/Dec 1992), 11-20.
-
- Sirea/README.md at master · dmbarbour/Sirea
- Sirea - Simply Reactive! Declarative orchestration in Haskell using RDP
- The Essence of FRP
-
- Why Racket? Why Lisp? | Butterick’s Practical Typography
-
- Universal algebra - Wikipedia, the free encyclopedia
-
- p303-ghuloum.pdf
-
- () - fplad12-talk_henrik.pdf
-
- Logic for Applications (Texts in Computer Science): Anil Nerode, Richard Shore: 9780387948935: Amazon.com: Books
- Logic for Applications (Texts in Computer Science) [Anil Nerode, Richard Shore] on Amazon.com. *FREE* shipping on qualifying offers. In writing this book, our goal was to produce a text suitable for a first course in mathematical logic more attuned than the traditional textbooks to the re cent dramatic growth in the applications oflogic to computer science. Thus
- Main.dvi - graphs.pdf
-
- GraphDoc3.dvi - TR330.pdf
-
- InductiveGraphs_JFP01.pdf
-
- repa.pdf
-
- Mutation testing - Wikipedia, the free encyclopedia
-
- Adventure (Madeon album) - Wikipedia, the free encyclopedia
-
- 20510077 - rta2001.pdf
-
- Rho-Calculus papers
- Rho-Calculus papers
- tt-in-tt.pdf
-
- How to write Computer Science papers - HowToResearch-WrittenCommunication.pdf
-
- writing.pdf
-
- Rete algorithm - Wikipedia, the free encyclopedia
-
- Control.Monad.Tardis
-
- tardis: Bidirectional state monad transformer | Hackage
-
- Mindfuck: The Reverse State Monad | Luke Palmer
- Someone in the #haskell IRC channel mentioned the "reverse state monad" explaining that it used the state from the next computation and passed it to the previous one. Well, I just had to try this! First, a demonstration: we will compute the fibonacci numbers by starting with them and mapping them back to the empty…
- FS: Backwards State, or: The Power of Laziness
-
- http://clathomasprime.github.io/hask/freeDecision
-
- ThelopWiki: FrontPage
-
- Language Oriented Programming
-
- main.dvi - jshutt.pdf
-
- HeteroVisualPL_VL95.pdf
-
- CategoricalImperative_IFL98.pdf
-
- VLSemantics_JVLC98.pdf
-
- ase.dvi - ProgramADT_ASE01.pdf
-
- lemons.dvi - CustomInfRules_HCC02.pdf
-
- apples.dvi - Apples_PADL02.pdf
-
- stql.dvi - STQL_MSTIS.pdf
-
- position.dvi - STQLDesign_NSF02.pdf
-
- JVLC6.fm - VLEvolSpatialRel_JVLC02.pdf
-
- ucFinal.dvi - TypeSafeUpdates_ESOP03.pdf
-
- Zurg_JFP04.pdf
-
- pf.dvi - ParametricFortran_PADL04.pdf
-
- Monadify_SCP04.pdf
-
- PFP_JFP06.pdf
-
- tyinf.dvi - VisualTypeInf_JVLC06.pdf
-
- PF_JSME07.pdf
-
- VisualStrategies_VLHCC08.pdf
-
- SpreadsheetProgramming_ECSE09.pdf
-
- NeuronDiagrams_VLHCC10.pdf
-
- ABPinHaskell_DSL11.pdf
-
- SemanticsFirst_SLE11.pdf
-
- CausationDSEL_DSL11.pdf
-
- Surveyor: a DSEL for representing and analyzing strongly typed surveys - Surveyor_Haskell12.pdf
-
- VPwithCC_GTTSE12
-
- VLforExplainingProbReasoning_JVLC13.pdf
-
- GTD_FLOPS14.pdf
-
- LetsHearBothSides_VLHCC14.pdf
-
- Type-based parametric analysis of program families
-
- bpp-mezzo.pdf
-
- The theory of Mezzo - fpottier-2014-04-ihp-mezzo-theory.pdf
-
- mezzo-icfp2013-long.pdf
-
- fpottier-protzenko-lessons-mezzo.pdf
-
- blame-for-all.pdf
-
- download
-
- tfp07-gronski-flanagan.pdf
-
- Undoing Dynamic Typing (Declarative Pearl) - Springer
-
- The Meaning of Types From Intrinsic to Extrinsic Semantics - viewcontent.cgi
-
- CiteSeerX — An Analysis of Girard's Paradox
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): this article is to present applications of the Burali-Forti paradox to some formal systems. The first such application is due to J.Y. Girard, who showed
- Haskell Equational Reasoning Assistant - HaskellWiki
-
- Branch and cut - Wikipedia, the free encyclopedia
-
- On the Importance of Purity | Lambda the Ultimate
-
- f22-terauchi.dvi - icfp05-witness.pdf
-
- Orc, a simple and expressive process calculus | Lambda the Ultimate
-
- Higher Logics: On the Importance of Purity
-
- Type and Effect Systems: Behaviours for Concurrency: Torben Amtoft, Flemming Nielson, Hanne Riis Nielson: 9781860941542: Amazon.com: Books
- Type and Effect Systems: Behaviours for Concurrency [Torben Amtoft, Flemming Nielson, Hanne Riis Nielson] on Amazon.com. *FREE* shipping on qualifying offers. Presents and develops current validation techniques for detecting safety violations. The focus of the text is on the correctness of techniques that suffice for fully automatic validation of key components of such systems. It builds on and extends the notion of types
- blame.pdf
-
- CiteSeerX — Citation Query Relations between diagonalization, proof systems, and complexity gaps
- CiteSeerX - Scientific documents that cite the following paper: Relations between diagonalization, proof systems, and complexity gaps
- Relations between diagonalization, proof systems, and complexity gaps
-
- Memetic Algorithm Framework
-
- sledgehammer.pdf
-
- Azul's Pauseless Garbage Collector
-
At the JavaOne 2010 conference in San Francisco, Gil Tene, CTO of Azul
Systems, discusses their pauseless garbage collector. In this interview, he
explains the pauseless collection algorithm.
- Propositions as [Types] | Mathematics and Computation
-
- Squeak/Smalltalk
- Squeak is a modern, open source, full-featured implementation of the powerful Smalltalk programming language and environment.
- Stability without State | Awelon Blue
- I understand `state` to be a summary of the past, maintained in the present, to inform the future. State is a powerful tool, and essential in many problems (such as writing this text). But state is often too powerful - and that power corrupts. State enables momentary inconsistencies of the past to propagate into the…
- Source-Stable Uniqueness | Awelon Blue
- Live programming, continuous deployment, orthogonal persistence, debugging - a quality these have in common is that we want state to remain stable across external interference, i.e. so we don't lose important work. One mechanism to achieve this is to externalize state, e.g. keep it in a database, or carefully save and restore in a manner…
- Local State is Poison | Awelon Blue
- Up through early 2011, my visions of RDP still called for `new` (as in `new Object()` or `newIORef`). At that time, my vision of an RDP language was a two-layer model: the language would support a separate initialization step for toplevel and dynamic behaviors. But multiple layers was inconvenient, complex, and inelegant no matter how…
- jfp12-draft-fcdf.pdf
-
- Jay McCarthy
-
- McBride Derivative paper | Lambda the Ultimate
-
- Research | François Bergeron, UQAM
-
- week202
-
- Publications of G. Huet
-
- Publications of G. Huet
-
- ACM Turing Award Lectures: The First Twenty Years 1966-1985: ACM: 0785342548853: Amazon.com: Books
- ACM Turing Award Lectures: The First Twenty Years 1966-1985 [ACM] on Amazon.com. *FREE* shipping on qualifying offers.
- Stanford Computer Science Technical Reports and Technical Notes
-
- Download generatingfunctionology
-
- Error - Durham University
-
- partial-draft.pdf
-
- Weyl algebra - Wikipedia, the free encyclopedia
-
- Ore Algebra -- from Wolfram MathWorld
-
- [math/0601458] Categorified Algebra and Quantum Mechanics
-
- Esp.pdf
-
- Full page fax print - SfGP2006.pdf
-
- Species: making analytic functors practical for functional programming
-
- Doron Zeilberger's 74th Opinion
-
- a Practical Theory of Programming
-
- Chris Granger - Light Table - a new IDE concept
-
- Light Table (software) - Wikipedia, the free encyclopedia
-
- Chris Granger - Beyond Light Table
-
- Incidental Complexity
- Incidental Complexity is the development diary/blog of Eve
- Incidental Complexity
- Incidental Complexity is the development diary/blog of Eve
- Incidental Complexity
- Incidental Complexity is the development diary/blog of Eve
- Incidental Complexity
- Incidental Complexity is the development diary/blog of Eve
- Incidental Complexity
- Incidental Complexity is the development diary/blog of Eve
- Incidental Complexity
- Incidental Complexity is the development diary/blog of Eve
- verifcomp.pdf
-
- [1512.03385] Deep Residual Learning for Image Recognition
-
- Ownership You Can Count On - Dingle07Ownership.pdf
-
- CiteSeerX — Minimizing Reference Count Updating with Deferred and Anchored Pointers for Functional Data Structures
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): this paper.
- CiteSeerX — Citation Query A.J.M.: On the Shape of Mathematical Arguments
- CiteSeerX - Scientific documents that cite the following paper: A.J.M.: On the Shape of Mathematical Arguments
- rosette.pldi14.pdf
-
- Jaakko Hintikka » Philosophy | Blog Archive | Boston University
-
- Amazon.com: The Principles of Mathematics Revisited (9780521624985): Jaakko Hintikka: Books
- Amazon.com: The Principles of Mathematics Revisited (9780521624985): Jaakko Hintikka: Books
- Dynamo-Dynamic Logic Programming
-
- Knuth: Selected Papers on Computer Languages
-
- Amazon.com: Language Myths (9780140260236): Laurie Bauer, Peter Trudgill: Books
- Amazon.com: Language Myths (9780140260236): Laurie Bauer, Peter Trudgill: Books
- Your Wish is My Command
-
- The Man Who Listens to Horses: Monty Roberts: 9780345427052: Amazon.com: Books
- The Man Who Listens to Horses [Monty Roberts] on Amazon.com. *FREE* shipping on qualifying offers. "It all dates from those summers alone in the high desert, me lying on my belly and watching wild horses with my binoculars for hours at a time. Straining to see in the moonlight
- Conference Series in the Interaction Design Foundation Research Bibliography » Interaction Design Foundation
- Conference Series in the Interaction Design Foundation Research Bibliography
- SHRDLU resurrection
-
- LAD+13.pdf
-
- Software Reliability Lab | ETH | Jsnice
- Software Reliability Lab in ETH
- () - 1005.0524.pdf
-
- Realizability - Wikipedia, the free encyclopedia
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- 【东方】【喵玉汉化】露米娅大家族_其他_动画_bilibili_哔哩哔哩弹幕视频网
- 原创 欢乐的十进制与小十进制,没救的女巫(摇头)
- 【东方】東方バスケ(东方篮球)【1-16】_其他_动画_bilibili_哔哩哔哩弹幕视频网
- nm6061004,mylist/10872083 第一次投稿。这个是和摔跤祭差不多形式的四格漫画 一开始作画的挺糟糕的不过到了后期就明显进步了很多了。
- 【东方MMD】和魔理沙的幽会【结尾高能注意】_剧情MMD_动画_bilibili_哔哩哔哩弹幕视频网
- sm24345593 アリス「ダメよ!!!」嗯,这句话就不用我翻译了吧www~作者かにみそュ゚タっ!
- Friedman translation - Wikipedia, the free encyclopedia
-
- Professor Douglas S. Bridges - Mathematics and Statistics - University of Canterbury
-
- Robertson–Seymour theorem - Wikipedia, the free encyclopedia
-
- stm.dvi - 2005-ppopp-composable.pdf
-
- Céu: The Programming Language
-
- Shadershop
-
- Yair Chuchem: Lamdu: Towards a next generation IDE on Vimeo
- Lamdu is a structural code editor which mimics the convenience of textual code editing while leveraging its understanding of the code to offer intelligent type-aware…
- Patrick Dubroy: Moonchild on Vimeo
- Moonchild is a toolkit for experimenting with new kinds of programming interfaces, based on a text editor written in HTML and JavaScript. The editor supports plugins…
- Christopher Schuster: Traveling through Time and Code on Vimeo
- Traditional debugging visualizes the execution state at a certain point in time. With omniscient debugging, it is possible to navigate and inspect the execution…
- Joel Galenson: CodeHint on Vimeo
- There are many tools that help programmers find code fragments, but most are inexpressive and rely on static information. We present a new technique for synthesizing…
- genyris in 15mins on Vimeo
- This is "genyris in 15mins" by on Vimeo, the home for high quality videos and the people who love them.
- Mark Mahoney: Version Control Optimized for Teaching and Learning on Vimeo
- Modern version control systems are optimized to be disk efficient. In the twenty first century, this seems like the wrong variable to optimize for. Instead, version…
- David Broderick: Kaya: Declarative Reactive on Vimeo
- Kaya is declarative like SQL, but reactive like a spreadsheet. In fact, the spreadsheet metaphor pervades the language. There is no text editor, but instead you…
- Bill Burdick: Leisure on Vimeo
- This is Leisure, a document-based computing environment that runs on the web, so it doesn't require any installation or even your own computer. Leisure tries…
- Nikolai Suslov: Virtual World Framework & OMeta on Vimeo
- Virtual World Framework & OMeta. Collaborative programming of distributed objects with user defined languages. The video shows the prototype of integration…
- Human–computer interaction - Wikipedia, the free encyclopedia
-
- Four Solutions to a Trivial Problem - YouTube
- Google Tech Talk December 1, 2015 (click "show more" for more info) Presented by Guy L. Steele Jr. ABSTRACT We present a small but interesting geometrical pr...
- Starting Forth
-
- Example Forth Code
-
- Thinking Forth
-
- Chuck Moore
-
- Forth Simplicity
-
- Forth Readability
-
- Forth Reusability
-
- Forth Portability
-
- Forth Community
-
- Forth Wiki Projects
-
- Forth Macro
-
- Algebraic reconstruction of types and effects
-
- typesandeffects.dvi - NiNi99tes.pdf
-
- odersky-scala-theory.pdf
-
- MacQueen86.pdf
-
- harper-mm-90.pdf
-
- A type-theoretic approach to higher-order modules with sharing
-
- A Theory of Mixin Modules: Algebraic Laws and Reduction Semantics.
- A Theory of Mixin Modules: Algebraic Laws and Reduction Semantics. on ResearchGate, the professional network for scientists.
- main.dvi - toplas.pdf
-
- download
-
- On an Intuitionistic Modal Logic - Springer
-
- Mathematical Structures in Computer Science - A judgmental reconstruction of modal logic - Cambridge Journals Online
- We reconsider the foundations of modal logic, following Martin-Löf's methodology of distinguishing judgments from propositions. We give constructive meaning explanations for necessity and possibility, which yields a simple and uniform system of natural deduction for intuitionistic modal logic that does not exhibit anomalies found in other proposals. We also give a new presentation of lax logic and find that the lax modality is already expressible using possibility and necessity. Through a computational interpretation of proofs in modal logic we further obtain a new formulation of Moggi's monadic metalanguage.
- Categorical and Kripke Semantics for Constructive S4 Modal Logic - Springer
-
- download
-
- thesis.pdf
-
- mscs00.pdf
-
- Continuations and delimited control
- A collection of articles on delimited and undelimited
continuations and context-passing programming.
- scheme2003.dvi - adding-threads.pdf
-
- Syntax extension for Monads in OCaml
-
- Archives of the Caml mailing list > Message from Diego Olivier Fernandez Pons
-
- Zipper-based File/OS - zfs-talk.pdf
-
- Continuations and delimited control
- A collection of articles on delimited and undelimited
continuations and context-passing programming.
- PVS Specification and Verification System
-
- Maude ITP
-
- untitled
-
- PRL Project Library of Formal Definitions and Proofs
- implementing computational mathematics and providing logic-based tools that help automate programming
- Moshe Looks - Automated Program Learning for Artificial General Intelligence on Vimeo
- This is "Moshe Looks - Automated Program Learning for Artificial General Intelligence" by on Vimeo, the home for high quality videos and the people who…
- GOEDEL MACHINE HOME PAGE
-
- gmAGI.pdf
-
- A Field Guide to Genetic Programming: Amazon.co.uk: Riccardo Poli, William B. Langdon, Nicholas Freitag McPhee: 9781409200734: Books
- Buy A Field Guide to Genetic Programming by Riccardo Poli, William B. Langdon, Nicholas Freitag McPhee (ISBN: 9781409200734) from Amazon's Book Store. Free UK delivery on eligible orders.
- OPTIMAL ORDERED PROBLEM SOLVER (OOPS)
-
- LiveCode - Wikipedia, the free encyclopedia
-
- AIXI - Lesswrongwiki
-
- Recursive self-improvement - Lesswrongwiki
-
- Seed AI - Lesswrongwiki
-
- Gödel Machines: Fully Self-referential Optimal Universal Self-improvers - Springer
-
- agi2011bas.pdf
-
- A family of Gödel machine implementations
-
- Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs: Mingsheng Ying: 9781461265221: Amazon.com: Books
- Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs [Mingsheng Ying] on Amazon.com. *FREE* shipping on qualifying offers. The purpose of this book is to establish a theory of approximate correctness and infinite evolution of concurrent programs by employing some notions and tools from point-set topology. Professionals
- Elements of Programming: the book
-
- Category Theory for the Java Programmer | reperiendi
- [Edit May 11, 2012: I've got a whole blog on Category Theory in JavaScript.] There are several good introductions to category theory, each written for a different audience. However, I have never seen one aimed at someone trained as a programmer rather than as a computer scientist or as a mathematician. There are programming languages…
- main.dvi - probabilistic_measure.pdf
-
- Herding Cats: A Primer for Programmers Who Lead Programmers: J. Hank Rainwater: 9781590590171: Amazon.com: Books
- Herding Cats: A Primer for Programmers Who Lead Programmers [J. Hank Rainwater] on Amazon.com. *FREE* shipping on qualifying offers. This self-help guide is for programmers who need to improve their management and leadership skills.
- CiteSeerX — A type-correct, stack-safe, provably correct, expression compiler
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Conventional approaches to compiler correctness, type safety and type preservation have focused on off-line proofs, either on paper or formalised with a machine, of existing compilation schemes with respect to a reference operational semantics. This pearl shows how the use of dependent types in programming, illustrated here in Epigram, allows us not only to build-in these properties, but to write programs which guarantee them by design and subsequent construction. We focus here on a very simple expression language, compiled into tree-structured code for a simple stack machine. Our purpose is not to claim any sophistication in the source language being modelled, but to show off the metalanguage as a tool for writing programs for which the type preservation and progress theorems are self-evident by construction, and finally, whose correctness can be proved directly in the system. In this simple setting we achieve the following; • a type-preserving evaluation semantics, which takes typed expressions to typed values. • a compiler, which takes typed expressions to stack-safe intermediate code. • an interpreter for compiled code, which takes stack-safe intermediate code to a big-step stack transition. • a compiler correctness proof, described via a function whose type expresses the equational correctness property. 1
- regtypes.pdf
-
- Neil Mitchell's home page
-
- Human-Centered Design: an Introduction - University of California, San Diego | Coursera
- Human-Centered Design: an Introduction from University of California, San Diego. In this course, you will learn how to design technologies that bring people joy, rather than frustration. You'll learn several techniques for rapidly prototyping and evaluating multiple interface alternatives -- and why rapid prototyping and comparative evaluation are essential to excellent interaction design. You'll learn how to conduct fieldwork with people to help you get design ideas. How to make paper prototypes and low-fidelity mock-ups that are interactive -- and how to use these designs to get feedback from other stakeholders like your teammates, clients, and users. Armed with these design-thinking strategies, you’ll be able to do more creative human-centered design in any domain. Take free online classes from 120+ top universities and educational organizations. We partner with schools like Stanford, Yale, Princeton, and others to offer courses in dozens of topics, from computer science to teaching and beyond. Whether you are pursuing a passion or looking to advance your career, Coursera provides open, free education for everyone.
- Interactive Computer Graphics - The University of Tokyo | Coursera
- Interactive Computer Graphics from The University of Tokyo. Computer graphics can be a powerful tool for supporting visual problem solving, and interactivity plays a central role in harnessing the users' creativity. This course will introduce various interactive tools developed in computer graphics research field with their design rationales and algorithms. Examples include enhancements to graphical user interfaces, authoring tools for 2D drawings and 3D animations, and interactive computer-aided design systems. Rich live demonstrations and course assignments will give you insights and skills to design and implement such tools for your own problems. Take free online classes from 120+ top universities and educational organizations. We partner with schools like Stanford, Yale, Princeton, and others to offer courses in dozens of topics, from computer science to teaching and beyond. Whether you are pursuing a passion or looking to advance your career, Coursera provides open, free education for everyone.
- Design of useful things | Playlist | TED.com
- Quirky, fascinating talks about the design of practical things we all need, whether we know it or not.
- Craftsmanship | Playlist | TED.com
- What feels so good about getting your hands dirty and making something? The following talks speak to the art of craft.
- Seminars · Stanford HCI Group - CS547 Winter 2016
-
- Stanford Online - CS547 Human-Computer Interaction Seminar 3/14/2014
-
- Winter 2013-2014
-
- 【精校】设计天赋第1集.机器之魂中英字幕.【夏末秋字幕组】_视频在线观看 - 56.com
- The Genius of Design是BBC2台近期开始播出的关于产品设计的一系列纪录片,每集时长60分钟,通过采访各知名设计师及相关的设计评论者,一起去探究产品设计的历史和未来.
- 【精校版】 .设计天赋.第2集.民主设计中英字幕[夏末秋字幕组]_视频在线观看 - 56.com
- 设计天赋.第2集.民主设计[夏末秋字幕组]
夏末秋艺术组,致力翻译美术 音乐 设计 相关纪录片
热爱+分享+成长=联系,夏末秋艺术组欢迎您的加入~
- 设计天赋.第四集[夏末秋字幕组]_视频在线观看 - 56.com
- 设计天赋
- 【精校版】.设计天赋.第5集.欲望之物[夏末秋字幕组]_视频在线观看 - 56.com
- The Genius of Design是BBC2台近期开始播出的关于产品设计的一系列纪录片,每集时长60分钟,通过采访各知名设计师及相关的设计评论者,一起去探究产品设计的历史和未来.
- Design giants | Playlist | TED.com
- From graphics to products, check out these talks by some of the world's greatest designers.
- PPDP13.pdf
-
- GLEE Website
-
- future-of-computing.pdf
-
- popl11.pdf
-
- [1008.4831] Foundations of Inference
-
- Higher Logics: Ad-hoc Extensions in .NET
-
- Church Wiki
-
- Synthesizing geometry constructions
-
- CREST - 虚数の中に月の出づる (Kyosu no Naka ni Tsuki no Dezuru) - Shop voxwave
- This CD has been released for Comiket 89 (2015/12/30). 20th album of Crest, it contains seven songs. You can listen to an audio crossfade (preview) below.
- 【C89新作】虚数の中に月の出づる – Crest
- 【東方アレンジCD】虚数の中に月の出づるC89新作東方アレンジCDは新たな参加メンバーを多数迎えたとても意欲的な作品です。作家陣は以前からのスタッフに加え、秋のコラボEPのメンバーとの合作で新たな彩りを、Vocalは台湾
- Simon Peyton Jones: book
- Simon Peyton Jones: papers
- do your lenses even do notation?
-
- Tying the type knot gives us theorems for cheap
-
- The type lens laws
-
- A neat trick for partially closed type families
-
- lens you an applicative for great haskell?
-
- I got lenses in my Functors
-
- The artificial intelligence
-
- PokerPirate's operation
-
- PokerPirate - Overview
-
- Teach Yourself Logic: A Study Guide (and other Book Notes) | Logic Matters
-
- dissertation.pdf
-
- Ensemble learning - Wikipedia, the free encyclopedia
-
- Metaheuristic - Wikipedia, the free encyclopedia
-
- axelsson2013using.pdf
-
- Things that amuse me: April 2007
-
- Things that amuse me: May 2007
-
- Things that amuse me: June 2007
-
- Things that amuse me: July 2007
-
- Things that amuse me: August 2007
-
- Things that amuse me: October 2007
-
- Things that amuse me: November 2007
-
- Things that amuse me: March 2008
-
- Things that amuse me: July 2008
-
- Things that amuse me: December 2008
-
- Things that amuse me: January 2009
-
- Things that amuse me: June 2009
-
- Things that amuse me: April 2011
-
- Things that amuse me: May 2011
-
- Things that amuse me: July 2011
-
- Things that amuse me: April 2014
-
- Conal Elliott » Garbage collecting the semantics of FRP
-
- Tangible Functional Programming - YouTube
- Google Tech Talks November, 7 2007 ABSTRACT We present a user-friendly approach to unifying program creation and execution, based on a notion of "tangible va...
- Tagless-Final Style
- Typed-preserving, typed tagless interpreters, type-checkers and (staging-based) compilers
- josephmisiti/awesome-machine-learning: A curated list of awesome Machine Learning frameworks, libraries and software.
- awesome-machine-learning - A curated list of awesome Machine Learning frameworks, libraries and software.
- prakhar1989/awesome-courses: List of awesome university courses for learning Computer Science!
- awesome-courses - :books: List of awesome university courses for learning Computer Science!
- okulbilisim/awesome-datascience: An awesome Data Science repository to learn and apply for real world problems.
- awesome-datascience - :memo: An awesome Data Science repository to learn and apply for real world problems.
- edobashira/speech-language-processing: A curated list of speech and natural language processing resources
- speech-language-processing - A curated list of speech and natural language processing resources
- jbhuang0604/awesome-computer-vision: A curated list of awesome computer vision resources
- awesome-computer-vision - A curated list of awesome computer vision resources
- ChristosChristofidis/awesome-deep-learning: A curated list of awesome Deep Learning tutorials, projects and communities.
- awesome-deep-learning - A curated list of awesome Deep Learning tutorials, projects and communities.
- lucasviola/awesome-functional-programming: A curated list of functional programming resources such as blog posts, communities, discussion topics, wikis and more.
- awesome-functional-programming - :alien: A curated list of functional programming resources such as blog posts, communities, discussion topics, wikis and more.
- mre/awesome-static-analysis: A curated list of static analysis tools, linters and code quality checkers for various programming languages
- awesome-static-analysis - A curated list of static analysis tools, linters and code quality checkers for various programming languages
- papers-we-love/papers-we-love: Papers from the computer science community to read and discuss.
- papers-we-love - Papers from the computer science community to read and discuss.
- JanVanRyswyck/awesome-talks
- Contribute to awesome-talks development by creating an account on GitHub.
- enjalot/algovis: collection of projects and links about algorithm visualization
- algovis - collection of projects and links about algorithm visualization
- owainlewis/awesome-artificial-intelligence: A curated list of Artificial Intelligence (AI) courses, books, video lectures and papers
- awesome-artificial-intelligence - A curated list of Artificial Intelligence (AI) courses, books, video lectures and papers
- rossant/awesome-math: A curated list of awesome mathematics resources
- awesome-math - A curated list of awesome mathematics resources
- vhf/free-programming-books: Freely available programming books
- free-programming-books - :books: Freely available programming books
- matteofigus/awesome-speaking: A collection of awesome resources about public speaking
- awesome-speaking - A collection of awesome resources about public speaking
- watson/awesome-computer-history: An Awesome List of computer history videos, documentaries and related folklore
- awesome-computer-history - An Awesome List of computer history videos, documentaries and related folklore
- lucasviola/awesome-tech-videos: A curated list of tech conferences from youtube, vimeo, etc for us to get inspired ;)
- awesome-tech-videos - :tv: A curated list of tech conferences from youtube, vimeo, etc for us to get inspired ;)
- A pattern classification approach to evaluation function learning
-
- Supporting peers in massive classes |
-
- Interaction Design Research
-
- HCI Design
- Human-Computer Interaction Design
- Beast.dvi - beast.pdf
-
- Many faces of the fixed-point combinator
- A collection of various ways to express the fix-point combinator in typed and untyped languages.
- Deconstructing Functional Programming
- Gilad Bracha explains how to distinguish FP hype from reality and to apply key ideas of FP in non-FP languages, separating the good parts of FP from its unnecessary cultural baggage.
- Harmonia Research Project
-
- [Haskell] Eliminating Array Bound Checking through Non-dependent types
-
- BrokenThorn Entertainment
- Extensive and comprehensive resources and tutorials for the operating system
and video game developer. Updated daily with the latest news and updates.
- Ruins of forgotten empires: APL languages | Locklin on science
- One of the problems with modern computer technology: programmers don't learn from the great masters. There is such a thing as a Beethoven or Mozart of software design. Modern programmers seem more familiar with Lady Gaga. It's not just a matter of taste and an appreciation for genius. It's a matter of forgetting important things.…
- Read-Eval-Print-λove by Michael Fogus [Leanpub PDF/iPad/Kindle]
- Read-Eval-Print-λove is a bi-monthly newsletter of original content and curation about the Lisp family of programming languages and little-languages in general.
- Exponential Decay of History, Improved | Awelon Blue
- In an earlier article, I described exponential decay of history as an alternative to ring buffers. In this article, I'll provide a full recap and an improved design. Exponential decay of history is a pattern that competes with ring-buffers, least-recently-used heuristics, and other techniques that represent historical information in a limited space. Like ring buffers,…
- Yield for Effects | Awelon Blue
- The functional programming communities have largely settled on monad interpreters as a basis for modeling effects. However, monadic effects are synchronous by default, which is a disadvantage in many contexts. I would like to encourage exploration of an even simpler effects model in a purely functional context: shared memory. There has been a recent movement…
- User-Defined Syntax | Awelon Blue
- User-defined syntax is a powerful, proven tool for enhancing the expressiveness of a language and applicability to diverse domains. Developers of rich APIs and frameworks are able to augment their interfaces - introducing syntactic sugar for common expressions and data, enforcing protocols and schema. Though user-defined syntax is limited in its ability to handle cross-cutting…
- Comparing FRP to RDP | Awelon Blue
- Functional Reactive Programming (FRP) was pioneered by Conal Elliott and Paul Hudak around 1995 and published as Functional Reactive Animation in 1997. It has developed much since then. There are two common approaches to FRP: signal composition (Signal a), or composition of signal-transformers (Signal a -> Signal b). The latter version is sometimes called 'arrowized'…
- FRP Fails at the Edges | Awelon Blue
- Functional Reactive Programming (FRP) fails for composition between open systems. For example: We can model a web-server as an FRP expression that transforms input connection events and state to output connection events and state updates. We can model a client as an FRP expression that takes UI and network events and generates UI output and…
- Reject Remote Values | Awelon Blue
- Haskell is a lazy programming language, in which a value is not fully computed before observed in a function; this easily allows for infinite structures, mutual recursion, and parallel processing. Oz/Mozart uses logic variables, which allow us to declare a variable, share it in a structure, and unify it in concurrent computation. I find myself…
- Dynamic Behaviors in RDP | Awelon Blue
- RDP behaviors may be constructed and executed at runtime to extend a static program. Dynamic behaviors essential for many in-the-large RDP design patterns: pluggable extensibility - a service or application can publish dynamic behaviors into a shared registry, allowing subsystems observing that registry to begin using it at their own discretion. The converse is also…
- Signals in RDP | Awelon Blue
- Reactive Demand Programming (RDP) describes behavior as signal transformers, in continuous time, with side-effects. For example, I might push a control signal to a camera (to influence pan, zoom, tilt, and focus), and the camera will provide a response signal in return (perhaps containing video image or control state). As mentioned in an earlier article,…
- Avoiding State with RDP | Awelon Blue
- Reasoning about stateful programs is difficult, especially if they are long-lived or extensible. Reactive Demand Programming (RDP) helps by obviating or statelessly supporting many traditional uses of state that do not truly need to be stateful. real-time queues and caching are well served by signals in RDP. A stateful queue is only needed for tasks…
- Demand Monitors – Heart and Soul of RDP | Awelon Blue
- The demand monitor is perhaps one concept that motivates the rest of Reactive Demand Programming, and distinguishes it from nearly all other programming models. The idea is extremely simple: we can aggregate incoming demands, and observe the demands at any given instant as a set. The idea of demand corresponds to a request, command, or…
- Linear Types and RDP? | Awelon Blue
- I've been thinking recently about how I might achieve linearity types for RDP. A type is 'linear' if it must be consumed at least once... and at most once. Linear types are very useful. They can be used to enforce protocols, handshakes, that open files are closed when we're done, that closed files are opened…
- Q&A RDP from LtU | Awelon Blue
- From a recent discussion on LtU: Q: How would you implement stateful behaviors, like the tuple space? Reactive Demand Programming (RDP) is designed to orchestrate stateful behaviors (and sensors, actuators, foreign services), not to implement them. So access to state is treated like a foreign service or FFI, but with a few standard models provided…
- Trouble with Typestate | Awelon Blue
- If you are unfamiliar with it, typestate is a property explored by several new general purpose programming languages such as Plaid and Rust. The idea is to lift object states into the type system - i.e. initialization status, or whether a file is open. This feature promises to catch various unnecessary mistakes, such as trying…
- Nothing New in RDP | Awelon Blue
- Access to state resources is a common requirement for many applications. Many tasks require fresh state that is not shared with any other service or behavior. In many programming models, one could achieve this by declaring a variable or a `new` object. With Reactive Demand Programming (RDP) one cannot ask for `new` objects. There are…
- Modularity without a Name | Awelon Blue
- A couple years ago, Gilad Bracha posted on the evils of import, referring to the common practice of importing modules by name. He argues that this use of import undermines configurability and reusability of modules. I encourage you to read this article if you have not already done so. There are at least two fundamental…
- Modules Divided: Interface and Implement | Awelon Blue
- In a recent article, I described how anonymous modules avoid an entanglement problem, and sketched an approach to achieving this. Unfortunately, the approach I sketch seems verbose, and would tend towards high search costs. While those disadvantages can be mitigated by discipline and idiom, dependency on discipline and idiom stinks of design failure. I would…
- Reactive State Transition | Awelon Blue
- Reactive State Transition (RST) is a simplistic state model I developed for use with Reactive Demand Programming (RDP). RST serves a similar role as would a finite state machine. Unlike a typical state machine, RST reacts to observable system state over continuous time rather than a stream of events. In this article I'll describe the…
- Vat Model for RDP | Awelon Blue
- The "vat" is a delightfully simple concept, which I borrow from E language. A vat is essentially a thread with an event loop, but with a few relevant properties: Vats do not share state. Vats are internally deterministic, up to input. Vat events are first-class, i.e. objects or closures. Vats communicate by causing events in…
- The Vat
- E: Cryptographic Capabilities for Distributed Smart Contracting
- Animated Reactive State Transition | Awelon Blue
- In my recent article on Reactive State Transition, I concluded that a transducer variation won't work cleanly due to potential for cyclic operations, and the interaction between continuous and discrete time. I must amend this argument. Augmenting RST transitions with delay would allow developers to ensure a finite number of discrete transitions between any two…
- Freedom and Crutches in Language Design | Awelon Blue
- Language designers aim to optimize an experience for their prospective users, but the criteria and heuristics by which they 'optimize' are widely varied and inconsistent (often within a single designer). In this article, I'll present two common points of contention and my opinion on them. Freedom First is picking a flavor of freedom: Anarchy: A…
- Declarative, Reactive Command Line | Awelon Blue
- A good command line interface allows its users to pack a lot of useful work into strings the size of twitter messages. There is no room for boiler-plate, no patience even for parentheses. Identifiers must be short. Parameters must have good defaults. Failure should usually be obvious and safe, allowing users to refine their commands…
- Animated Reactive Term Rewriting | Awelon Blue
- Rewrite systems are a general approach for modeling discrete computations and logics. A set of rewrite rules are applied to a term (or graph, or string, etc.) repeatedly until no further rewrites are possible. Rewriting is distinct from functional programming in that the `fixpoint` reduction (repeated application) is implicit, whereas functional expression of the same…
- Isomorphism is not Enough | Awelon Blue
- Too often, I see arguments of the general form: "I can transform feature X into Y, and the reverse, while maintaining relevant properties. I have an isomorphism. Therefore, I don't see the difference between X and Y." For the arguments I'm likely to participate in, X and Y tend to be languages, features, abstractions, protocols,…
- Social Aspects of PL Design | Awelon Blue
- Software development is ultimately a social experience. And I'm not just talking about teams of coders. Even sharing or using code via library, or services via API, is a social experience involving communication and relationships between humans. Consequently, there exists a vast array of social concerns surrounding the development experience: discovery, configuration and adaptation, maintenance…
- Defining `Declarative` | Awelon Blue
- I've seen many definitions for `declarative programming`. The term `declarative` is often contested because it has connotations and market buzz surrounding it - i.e. there is some advantage to saying your product is `declarative` even if that means stretching the term. I freely admit that I might be guilty of this, too. My understanding of…
- Declarative State | Awelon Blue
- State models favored for imperative programming, such as mutable references, are unsuitable for declarative programming models including Reactive Demand Programming (RDP). Declarative state is not difficult or complicated, but it is different and might require its own eureka moment. The general scenario is that we are manipulating state by use of declarations. As discussed in…
- Discarding Disjoin | Awelon Blue
- I lost motivation to keep working on my RDPIO implementation - I got sick of carrying Haskell type constraints around. Not Haskell's fault, just premature generalization on my part. So I've recently started a fresh implementation of RDP, called Sirea (simply reactive) for now. My goal with Sirea is to favor concrete types - one…
- Make for Haskell values, part alpha | Awelon Blue
- ...Make is a monad transformer... I commanded Google to search the web on my behalf for word of Dependency Injection in Haskell. I was disappointed to see only a few ruminations on using typeclasses. Inflexible, static, global typeclasses. Impenetrability! That's what I say! I'm not looking for much. Just the following features in one simple…
- Make for Haskell Values pt 2 of K | Awelon Blue
- A few days ago I wrote an article about Make for Haskell values. Somehow people read "Make" and ignore the "for Haskell values" part. So I'll clarify: Control.Make is intended to be a declarative dependency injection, build, and configurations model for Haskell values. Control.Make is intended for staged programming, where the Haskell value in question…
- Dynamic Anytime Algorithms | Awelon Blue
- I'm still thinking about ways to eliminate stateful semantics from large-scale reactive applications for RDP, i.e. pursuing stability instead. Stateless semantics make an application more robust against resets, disruption or partitioning, etc.. To achieve stability without state requires accepting some indeterminism in the semantics (though not the implementation), but this is often a worthy tradeoff. Stable…
- Windowed Memoization? | Awelon Blue
- I assume you already know what memoization is and why we might want to use it. In the context of reactive computations, memoization can improve performance a great deal, avoiding recalculation of data that has not changed. Most reactive paradigms, however, achieve only some trivial memoization - i.e. only for the last element, and only…
- Life With Objects | Awelon Blue
- This is a wordy response to Chris Turner's Life Without Objects. Many object models compose poorly. There are no generic methods to combine two objects into a meaningful third. Rather than composition, we get a Cartesian product of specializations (e.g. BufferedInputStream, ByteArrayOutputStream). Functional programming, by comparison, focuses very heavily on composition. We model programs with…
- Abandoning Commitment in HCI | Awelon Blue
- Today's applications and services are very committed to what they do for us. And I mean that in a bad way. When we send a message to a service, or call a procedure, or press a button, it is generally difficult to halt or undo. This has consequences for HCI design - buttons, toggles, "are…
- Why Not Events | Awelon Blue
- I've spent a lot of time arguing against event systems. I don't argue because they're bad; compared to batch processing or shared-state imperative concurrency, event systems (actors, vats, channels, etc.) solve many problems and are relatively easy to reason about. Rather, I argue against event systems because we can do even better. But my writings…
- Unlimited Detail for Large Animated Worlds | Awelon Blue
- A group called Euclideon from Australia has made extraordinary claims about Unlimited Detail technology - ability to achieve much more detail in a world as you zoom in or out by representing structures in terms of atoms of arbitrary precision. It is widely believed that they use sparse voxel octrees (or similar variations like kd-trees)…
- Natural Programming Language | Awelon Blue
- A recent essay about why natural language isn't computer code has been making a few rounds through the PL community. It seems to celebrate the precision required in computer languages, the differences between coders and writers. The article concludes: Fundamentally, good writers are empathetic, human and stylish. Good coders are literal, formal and algorithmic. To…
- Exponential Decay of History | Awelon Blue
- There are many problems for which it is useful to keep a history. A few examples of such problems: keep history of control-flow in an application for debugging purposes keep history of updates to a document for undo purposes keep history of a filesystem for backup and recovery purposes keep history of a command and…
- Stateless Stable Arts for Game Development | Awelon Blue
- In the months since grasping the concept of stateless stable models, I regularly find scenarios where I think, "A stateless stable model would be useful here." Unfortunately, I've not gotten around to implementing these models. (I still haven't. I might find time within a year, though.) While my interest in game development has waned since…
- Stone Soup Programming | Awelon Blue
- Stone soup programming is meant to evoke an image of throwing software components into a pot - in no particular order, and paying little attention to the ingredients - and the result being a nice application. The glue code between components is computed, statically or dynamically. In the static case, this becomes a simple form…
- Ubiquitous Programming with Pen and Paper | Awelon Blue
- Programming ideas strike at any time - while taking a walk, or standing in line. Meetings, for me, are a common location for programming ideas. A few slides or phrases catch my interest in an otherwise droll and predictable commentary. They mix with leftover thoughts and echoes of yesterday. New ideas are born. The desktop…
- Stateless Sound | Awelon Blue
- Most audio abstractions involve relative start and some finite bound (end time). That is, we might play(sound) starting at some given instant, and we expect the sound to continue playing until finished. The representation of sound may be stateless (e.g. an MP3 or WAV file). However, processing of the sound event imposes a state requirement…
- Sirea RDP Progress Update: Demand Monitors are Working | Awelon Blue
- My implementation of Reactive Demand Programming (RDP), Sirea, is gradually approaching a usable state. After vacation, I sat down and in just a couple programming sessions I got demand monitors into a working order. The implementation of demand monitors further provides useful components for rapid, robust integration of a variety of IO resources with RDP.…
- Anticipation in RDP Reduced | Awelon Blue
- Some time ago, I described anticipation in RDP. In that article, I envisioned a behavior intially called `anticipate`, that I eventually shortened to `bpeek`. For discrete-varying signals, it might be specialized to `bpeekL`. -- observe a specific distance into a signal's future -- return Nothing when signal is inactive in said future bpeek :: DT…
- Objects as Dependently Typed Functions | Awelon Blue
- One issue I have with objects is that I cannot compose them like functions (i.e. `f . g . h`). The reason for this is the method-set associated with each object - it requires a lot of wiring to compose two objects, and it is awkward to express or apply that wiring in a higher-order…
- Progress Report: Loops and Restarts in Sirea | Awelon Blue
- I've been working on Sirea quite a bit in the last few months, albeit making less progress than I had hoped. Mostly, I've been running in circles. In Reactive Demand Programming, all loops are indirect, via a shared external resource (e.g. shared state or a demand monitor). A simple behavior that might loop is: monitor…
- Ad-Hoc External State Models | Awelon Blue
- Encapsulation, Accessibility, Security One of the main reasons we encapsulate state is to gain more control over how it updates. For example, take your traditional, imperative, mutable state variables that respond to get and put actions. We might use one or two of these variables to model a queue, or a stack. Queues and stacks…
- Why Not FFI | Awelon Blue
- FFI - foreign function interface - is a common way for new languages to integrate with existing systems. But FFI is problematic in many ways. FFI represents ambient authority (the ability to 'import' authority to ad-hoc resources without a specific grant) which makes it difficult to integrate untrusted code. FFI requires more information about the…
- Modular Manipulation of the Link-Time Environment | Awelon Blue
- I'm in the process of hammering out a concrete design for Awelon, and my design efforts have taken me to some interesting places. My current application model looks like this: An Awelon application consists of a set of anonymous modules. Each module will directly manipulate the link-time environment. When the link-time environment stabilizes, the runtime…
- Programming with Augmented Reality | Awelon Blue
- Augmented reality (AR) is a powerful foundation for the next generation of 'integrated development environments' for many reasons. Developers can have sprawling workspaces across a room, a building, even a mountainside (depending on how much exercise the developer desires). There is little need for panning, zooming, and tabbing. Instead of menu navigation, a developer may…
- Tacit Programming with Arrows, Hands, and Zippers | Awelon Blue
- Arrows are a general purpose, highly composable programming model (and the foundation for my Reactive Demand Programming model). Zippers are a mechanism to model a bi-directional cursor in a tree-like structure (including the degenerate case of lists). A hand is a simple augmentation to a cursor: a hand can pick things up, carry them. Tacit…
- Multi Stack Environment in Awelon | Awelon Blue
- Last post, I took things to an extreme. Which is a good thing. Extremism tells us where the limits are. After we know the limits, we can seek balance. There is a simple problem with the tree-zipper environment: It is not obvious how to use it effectively. There are too many possibilities, too many ways…
- Imperative Metaprogramming of a Declarative Program | Awelon Blue
- A few people have been curious: Why am I modeling a multi stack environment in Awelon? Doesn't this seem imperative? Isn't the goal of relatively declarative models like reactive demand programming to get away from that? Traditionally, a dataflow model might be programmed with boxes and wires. The stacks in Awelon essentially model the imperative…
- Multi Stack Bootstrap | Awelon Blue
- I like the ideal of "language minimalism" - that the language provide a minimal set of operators, and that all further operations be modeled atop those. With regards to code proofs, language minimalism means we have less to trust and validate. Arrow primitives are a sufficient minimal set for ad-hoc data plumbing: -- PRIMITIVES first…
- Pipes that Flow in both Directions | Awelon Blue
- Almost every procedural language has out or in/out variables. Languages such as Oz/Mozart do something even more interesting - allowing variables to be declared and assigned in separate processes. This feature is sometimes modeled (at a larger granularity) as futures or promises. Reactive or dataflow models - pipes, iteratees, arrowized FRP, etc. - generally lack…
- Multi-Stack Environment part 2 | Awelon Blue
- Having experimented with the multi-stack environment, I'm now contemplating the elimination of anonymous stacks (stepLeft, stepRight, newStackRight, remStackRight) and instead switching to a system that only has the current stack, one hand, and a list of named stacks. The motivations for this: A simple stack/hand combo, with "roll" (of current stack) and "juggle" (of hand),…
- Staging is Simpler than Type Checking | Awelon Blue
- I'm taking an unusual approach to types with Awelon, one that I hope will work better than traditional approaches. Instead of "type checking", every Awelon program represents a compile-time program. If this compile-time program completes without errors, then the runtime behavior will be type safe. The runtime behavior of Awelon is described by an arrow…
- UI as an Act of Programming | Awelon Blue
- I've been thinking quite a bit, recently, about the relationship between UI and programming. A programming language is certainly a user interface - but usually a poor one from a human factors standpoint. And a UI can be considered a PL - a way for a human to communicate to a computer... but is usually…
- Semi-Static Structure | Awelon Blue
- Lisp, Scheme, and a few other languages represent most structure using pairs of values. In general, these languages are very dynamic: the structure of any value can be introspected at runtime using queries of the form "are you a number? are you a pair?" For many use-cases, this dynamism is welcome. However, it also can…
- Awelon Progress Report II | Awelon Blue
- In the last month, I've had only three significant accomplishments. I feel my biggest accomplishment was implementing the fixpoint function, a Z combinator, which becomes the basis for expressing recursive loops. The code for the Z combinator is not difficult - just `[swap dup bind swap compose] bind dup apply` in AO(1). But I found…
- Substructural Types in ABC | Awelon Blue
- Awelon Bytecode (ABC) has two operators, `k` and `f`, to support modeling of substructural constraints. In ABC, `k` will mark a block no-drop (relevant), and `f` will mark it no-copy (affine). If both marks are applied, the block is effectively linear. These properties can be enforced dynamically if necessary (i.e. halt the program upon attempted…
- Awelon Progress Report III | Awelon Blue
- Another month gone, so quickly. What the heck did I do? It's difficult to recall, but my git history is helping. It seems my major accomplishments this month were: implemented automatic unit testing for the AO dictionary (runs all `test.` words) implemented an automatic type analysis based on partial evaluation implemented a few list processing…
- Awelon Progress Report IV | Awelon Blue
- I spent most of March attempting different approaches to improve AO's performance. This isn't what I set out to do. At the end of February, I wrote: "My plans for the next month are to start building functions for data structures: maps/records, sequences, streams." And I did make a little progress in that direction -…
- Half-Embedded DSLs | Awelon Blue
- Domain Specific Languages (DSLs) come in two primary flavors: external or embedded. External DSLs have their own external tools - parsers, interpreters or compilers, optimizers, etc. - apart from any general purpose language. Embedded DSLs exist in context of a general purpose language such as JavaScript or Haskell. In practice, external DSLs tend to grow…
- Compiling ABC/AO | Awelon Blue
- I've spent most of this month developing a more sophisticated compiler for Awelon project, based on first translating the code into a dataflow graph, then translating to Haskell. This allows easy use of Haskell's variables, and more effective use of pure subprograms. Which, presumably, GHC knows how to optimize. At the moment, runtime performance only…
- ABC Linking with Provider Independent Security | Awelon Blue
- As I've mentioned in other posts, Awelon Bytecode (ABC) has a non-conventional approach to code reuse. A valid sequence of bytecode can be given a deterministic, cryptographically unique name - e.g. a secure hash. In ABC, the code to invoke this external bytecode resource might be represented with `{#secureHashOfBytecode}`. Logically, the identified bytecode is inlined…
- LZW-GC Streaming Compression | Awelon Blue
- LZW is a simple compression algorithm - certainly the simplest, most deterministic I could find in my investigations. And here I use 'deterministic' in the sense that there are no implementation-dependent decisions, ambiguities, smarts or heuristics. LZW has only one real decision to make: dictionary size. And for my application, which requires highly deterministic compression,…
- Embedded Literal Objects | Awelon Blue
- When a PL is designed for a text editor, it is natural that text is the richest embedded literal. The text editor provides the visualization and update HCI. And text can certainly be useful; beyond modeling a subset of human input or output, it can model embedded DSLs such as regular expressions. But text is…
- Awelon Progress Report VII | Awelon Blue
- The two months since my last report have been productive, albeit not in the directions I was aiming to proceed. Much of my work was exploratory. I've gained little of lasting value, but at least I've gained a little. In June, I developed a graph based intermediate representation for compiling Awelon Bytecode (ABC) into Haskell,…
- Introducing Wikilon | Awelon Blue
- I have decided to move forward with a wiki-based development environment for Awelon project, under the name Wikilon. Wikilon will be implemented as a Haskell warp web service using acid-state for persistence and websockets for liveness and reactivity. Wikilon can overcome several limitations that I feel to chafe in the current text-editor + console REPL…
- Logarithmic History v3 | Awelon Blue
- Exponential decay, resulting in log-scale lists, an excellent way to work with an unbounded amount of history in a bounded amount of space. I've described this in two previous articles [1][2]. In my first article, I modeled logarithmic decay via a sequence of ring buffers: each ring would lose (or merge) one of its items…
- Wikilon Filesystem | Awelon Blue
- Wikilon isn't just an online dictionary for AO code. It will offer a simple filesystem-like abstraction, allowing use as a software platform for creating interesting applications and services. Simple isn't easy. I've spent a great many hours designing, refining, and backtracking on the subject over the last ten days. A few of the design points…
- Extensible Syntax for Awelon Project | Awelon Blue
- I've been exploring extensible language for almost as long as I've been interested in PL. A few years ago, I posted some constraints for user-defined syntax that I had developed c.2007. More recently, I've described a alternative to DSLs based on embedding applet-like objects as literals in source code. The latter is especially interesting because…
- Command Language for Awelon | Awelon Blue
- Claw (command language for awelon) is an editable view and syntactic sugar for AO (awelon object). AO is a subset of Awelon Bytecode (ABC) that limits tokens and texts. Tokens of the form {%foo} link definitions of other words in a dictionary. Dependencies within the dictionary form a directed acyclic graph. (Recursion is anonymous, via…
- Wikilon Dictionary Applications | Awelon Blue
- A repeating cycle of simplification and refinement has fine-tuned Wikilon since I introduced it over a year ago. One area where Wikilon has changed significantly is its application model, that is: how I expect to host server-side applications and debugging. The idea now is to use AO dictionary applications for everything, including edit sessions and…
- Wikilon Performance Strategy | Awelon Blue
- Performance is a major concern I've struggled with over the last year. Peformance is important for a lot of applications, and to a lot of people. Without performance, Wikilon would never mature, never receive the users, attention, and funding it needs to mature into a productive tool. Without realizing it, I had made an assumption: that…
- Out of the Tarpit | Awelon Blue
- I recently re-read Out of the Tarpit by Ben Moseley and Peter Marks. This paper describes a strategy for eliminating accidental complexity from software. Some of their conclusions: input is modeled by outside agents updating relvars output is modeled by outside agents observing relations logic is expressed by deriving relations and data most state is cached computations for performance no need for control…
- Room 101: A Ban on Imports
-
- about:blank
-
- Ars Mathematica | Dedicated to the mathematical arts.
-
- Topological semantics of computer programs | Ars Mathematica
-
- John Tucker
-
- Jeffery Zucker -- Home Page
-
- text.dvi - text.pdf
-
- Abbas Edalat's Home Page
-
- Research papers
-
- Martín Escardó's research papers
-
- Martin Escardo
-
- mgs.pdf
-
- entcs87.pdf
-
- Gödel's ontological proof - Wikipedia, the free encyclopedia
-
- FormalTheology/GoedelGod: Formalizations of Gödel's Ontological Proof of God's Existence
- GoedelGod - Formalizations of Gödel's Ontological Proof of God's Existence
- Extremist Programming : Inside 736-131
-
- fogus: Broccoli: Abominable
- Pseudo-random ramblings from Fogus.
- Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components - JohnSun_vonNeumann.pdf
-
- pierce_1952.pdf
-
- 2012bica-phw
-
- Microsoft Word - omelas.doc - omelas.pdf
-
- 'There+Will+Come+Soft+Rains'+story+and+poem+and+tasks+bklt.pdf
-
- Onward! 2016 Papers - Onward! 2016
-
- 2000-calculemus-oants.pdf
-
- towexp.pdf
-
- jacm00.pdf
-
- 资源重发~东方Project(Liu in intimate—2013~6.1―MADeMAD)_东方吧_百度贴吧
-
- ROSCOQ.pdf
-
- Index of /refs
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- Compositional Analysis
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- ANN: Normal-order evaluation as bottom-up parsing
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- Hybrid logic - Wikipedia, the free encyclopedia
-
- Programming in Schelog
-
- A declarative logic programming system
- An applicative logic programming system with a
declarative set-theoretical semantics, and its applications
- Hybrid Logics Web Page
- Hybrid Logics Web Page
- July | 2015 | Pipe Dreams
- 1 post published by Ross Angle during July 2015
- May | 2015 | Pipe Dreams
- 1 post published by Ross Angle during May 2015
- March | 2015 | Pipe Dreams
- 2 posts published by Ross Angle during March 2015
- November | 2013 | Pipe Dreams
- 1 post published by Ross Angle during November 2013
- January | 2013 | Pipe Dreams
- 2 posts published by Ross Angle during January 2013
- April | 2012 | Pipe Dreams
- 3 posts published by Ross Angle during April 2012
- June | 2011 | Pipe Dreams
- 1 post published by Ross Angle during June 2011
- December | 2010 | Pipe Dreams
- 2 posts published by Ross Angle during December 2010
- June | 2010 | Pipe Dreams
- 1 post published by Ross Angle during June 2010
- April | 2010 | Pipe Dreams
- 1 post published by Ross Angle during April 2010
- July | 2009 | Pipe Dreams
- 1 post published by Ross Angle during July 2009
- April | 2009 | Pipe Dreams
- 3 posts published by Ross Angle during April 2009
- March | 2009 | Pipe Dreams
- 3 posts published by Ross Angle during March 2009
- June | 2008 | Pipe Dreams
- 6 posts published by Ross Angle during June 2008
- Paul Blain Levy Papers
-
- Call-By-Push-Value FAQ
-
- Call-By-Push-Value
-
- The Programming Language Zoo
-
- A toy call-by-push-value language | Mathematics and Computation
-
- PL Zoo | Search Results | Mathematics and Computation
-
- Mathematics and Computation | Mathematics for computers
-
- self-interpreter-for-T.pdf
-
- NSF Report Year 5 Final - tr2011004_steps11.pdf
-
- Functional Images
-
- Steps Toward The Reinvention of Programming | Lambda the Ultimate
-
- Can Simplicity Scale? – Embedded in Academia
-
- It’s All About Interfaces – Embedded in Academia
-
- myer-sutherland-design-of-display-processors.pdf
-
- Jargon File Resources
- Indispensable dictionary of hacker slang
- CiteSeerX — Parsing Mixfix Operators
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract. A simple grammar scheme for expressions containing mixfix operators is presented. The scheme is parameterised by a precedence relation which is only restricted to be a directed acyclic graph; this makes it possible to build up precedence relations in a modular way. Efficient and simple implementations of parsers for languages with user-defined mixfix operators, based on the grammar scheme, are also discussed. In the future we plan to replace the support for mixfix operators in the language Agda with a grammar scheme and an implementation based on this work. 1
- My history with Forth & stack machines
-
- Perceptual Image Difference Utility
-
- Alan Kay On Messaging
-
- paper-rethinking_supercompilation-29_sep_2010.pdf
-
- paper-deriving_a_relationship_from_a_single_example-04_sep_2009.pdf
-
- paper-losing_functions_without_gaining_data-03_sep_2009.pdf
-
- Ghostscript wrapper for C:\Users\NewUser\Desktop\TMR-Issue12.pdf - paper-hoogle_overview-19_nov_2008.pdf
-
- paper-not_all_patterns_but_enough-25_sep_2008.pdf
-
- paper-transformation_and_analysis_of_functional_programs-4_jun_2008.pdf
-
- paper-a_supercompiler_for_core_haskell-01_may_2008.pdf
-
- paper-deriving_generic_functions_by_example-26_oct_2007.pdf
-
- paper-uniform_boilerplate_and_list_processing-30_sep_2007.pdf
-
- paper-hatday-28_oct_2005.pdf
-
- Future Programming Workshop
-
- Future Programming Workshop
-
- Future Programming Workshop
-
- Future Programming Workshop 2014 Report
-
- Making it stick.: Even More on Reliability and Static Types
-
- Making it stick.: More on Reliability and Agile vs. Rigid Languages
-
- Making it stick.: Programming and Spreadsheets
-
- 知其所以然(三):为什么算法这么难?
- 广大码农同学们大多都有个共识,认为算法是个硬骨头,很难啃,悲剧的是啃完了还未必有用——除了面试的时候。实际工程中一般都是用现成的模块,一般只需了解算法的目的和时空复杂度即可。
不过话说回来,面试的时候面算法,包括面项目中几乎不大可能用到的算法,其实并不能说是毫无道理的。算法往往是对学习和理解能力的一块试金石,难的都能掌握,往往容易的事情不在话下。志于高者得于中。反之则不成立。另一方面,虽说教科书算法大多数都是那些即便用到也是直接拿模块用的,但不幸的是,我们这群搬砖头的有时候还非得做些发明家的事情:要么是得把算法当白盒加以改进以满足手头的特定需求;要么干脆就是要发明轮子。所以,虽说面试的算法本身未必用得到,但熟悉各种算法的人通常更可能熟悉算法的思想,从而更可能具备这里说的两种能力。
那么,为什么说算法很难呢?这个问题只有两种可能的原因:
算法本身就很难。也就是说,算法这个东西对于人类的大脑来说本身就是个困难的事儿。
讲得太烂。
下面会说明,算法之所以被绝大多数人认为很难,以上两个原因兼具。
我们说算法难的时候,有两种情况:一种是学算法难。第二种是设计算法难。对于前者,大多数人(至少我当年如此)学习算法几乎是在背算法,就跟背菜谱似的(“Cookbook”是深受广大码农喜爱的一类书),然而算法和菜谱的区别在于,算法包含的细节复杂度是菜谱的无数倍,算法的问题描述千变万化,逻辑过程百转千回,往往看得人愁肠百结,而相较之下任何菜谱涉及到的基本元素也就那么些(所以程序员肯定都具有成为好厨师的潜力:D)注意,即便你看了算法的证明,某种程度上还是“背”(为什么这么说,后面会详述)。我自己遇到新算法基本是会看证明的,但是发现没多久还是会忘掉,这是死记硬背的标准症状。如果你也啃过算法书,我相信很大可能性你会有同感:为什么当时明明懂了,但没多久就忘掉了呢?为什么当时明明非常理解其证明,但没过多久想要自己去证明时却发现怎么都没法补上证明中缺失的一环呢?
- 知其所以然(续)
- 我有一个习惯,看定理必看证明。一个你不明白其证明的定理在我看来比不知道这个定理还要糟糕,因它给你造成一种懂了的错觉。在没有明白背后的证明之前,任何一个定理对你来说都是等价的——等价于背乘法口诀(只不过有的长一点有的短一点)。一个原本美妙的定理,把其证明扔掉就是真正的买椟还珠,暴殄天物。
从现实意义来说,去理解一个定理的证明会带来巨大的好处,首当其冲的好处就是你很难再忘掉它。这一点其实很容易解释——在理解一个定理的证明之前,定理对你而言是一堆没有内在联系的词句,而在理解了证明之后,定理就归约为证明它所需的条件加上逻辑...这是一个树状的知识结构,越往上层走,需要记忆的节点就越少。
- 逃出你的肖申克(三):遇见20万年前的自己
- 《Synaptic Self》中曾提出一个发人深省的观点:由于人的大脑是经过漫长的进化年代“堆积”起来的,也就是说,从爬行动物到哺乳动物到高级灵长类这些进化阶段,我们的大脑从只有原始的反射模块,到拥有初步的情感区域,一直到神奇的具有6层结构的“新皮质”所支撑的高级认知能力,一步步走来。这个过程并非上帝预先编程架构好的,而更像是在既有结构上“叠床架屋”,比如,大脑从内到外基本上是按照进化年代来排序的,比如啮齿类等一些小型哺乳动物的新皮质是光滑的,这是新皮质在进化出高级灵长类之前的样子,后来为了解决大脑中空间不够的问题,进化之手发明了大脑皮层沟回,通过这些褶皱,在不增加太多占用体积的前提下使得大脑皮层表面积暴涨,正是这些褶皱使得灵长类进化出独特的高级认知活动,如工作记忆,语言。这种“堆砌式”的进化有它节省和复用的好处(《Kludge》),然而另一方面也带来了奇特的“进化时滞”效应——进化年代较近的大脑模块和较久远的模块之间要达成完美沟通需要一定的时间,在这之前便会造成多个模块之间面对同一个问题决策不一致的问题。
我们的高级认知模块明明知道有些事情很重要,必须提前准备并持之以恒,然而我们内心的另一个小声音却在万般阻挠我们把屁股从床上挪开或者把眼睛从网页上挪开;我们明明知道赌博,烟酒,犯罪是不对的,然而内心的一个小声音却在喋喋不休地催我们动手去做。我们明明知道高糖高脂肪的食物不宜多吃,但内心的一个小声音却总是怂恿着再吃最后一勺(不禁让人想起《傀儡人生》)。令人感到遗憾的是,很多时候在这个争端中败下阵来的却是代表更先进生产力的高级认知模块,更令人感到遗憾的是,在大多数时候我们的高级认知模块似乎根本就没有启用,而是凭借着本能或直觉“自动驾驶”自己的身体(《Gut Feelings》)。
- 暗时间
- 如果你有做总结的习惯,你在度过一段时间之后总结自己在某某领域投入了多少时间,建议千万不要粗略地去计算有多少天下班后拿起书来翻看过,因为这样你也许会发现书倒是常翻,但领悟却不见得多深,表面上花的时间不少,收益却不见得那么大。因为看书并记住书中的东西只是记忆,并没有涉及推理,只有靠推理才能深入理解一个事物,看到别人看不到的地方,这部分推理的过程就是你的思维时间,也是人一生中占据一个显著比例的“暗时间”,你走路、买菜、洗脸洗手、坐公车、逛街、出游、吃饭、睡觉,所有这些时间都可以成为“暗时间”,你可以充分利用这些时间进行思考,反刍和消化平时看和读的东西,让你的认识能够脱离照本宣科的层面。这段时间看起来微不足道,但日积月累将会产生庞大的效应。能够充分利用暗时间的人将无形中多出一大块生命。你也许会发现这样的人似乎玩得不比你少,看得不比你多,但不知怎么的就是比你走得更远。比如我就经常发现一些国外的牛人们为什么不仅学习牛逼,连“业余”玩儿的东东也都搞得特牛逼,一点都不业余(上次在《How We Decide》上看到斯坦福的一个牛人,理论物理学博士,同时是世界扑克大赛的前六名保持者,迄今累计奖金拿了六百多万刀),你会奇怪,这些家伙到底哪来的时间,居然可以在不止一个领域做到卓越?
- [BetterExplained]遇到问题为什么应该自己动手
- 我们在生活中总是在不停地试图做最优经济决策,只不过很多时候我们为适应远古社会而进化的大脑未必适用于现代工业社会(《Mean Genes》,《进化心理学》,《How We Decide》),所以很多时候我们可以在超市为选择哪一卷卫生纸斟酌半天(《Predictably Irrational》),却在面对生活中重大抉择的时候轻易就随波逐流(《Paradox Of Choice》)。
我们的很多决策依赖于情绪系统的输出(从进化时间上比较“旧”的大脑部分)(《How We Decide》,《Synaptic Self》),这部分大脑属于典型的经过了漫长进化时间所雕琢过的,决策机制严重适应远古社会的模块(《Mean Genes》),比如在物质贫乏的远古时期,不管什么时候遇到富含热量的食物是必吃无误的,所以我们的情绪大脑只要闻到美食是绝对不去克制诱惑的,长出脂肪又如何?有的是饥寒交迫的时候去燃烧这些脂肪。然而这条规则到了现代这个物质充裕的社会却成了灾难(去查一下美国的肥胖比例?),可谓成也萧何败萧何。这样的例子在《Mean Genes》中还有不少。
我们在学习新东西,遇到困难的时候,为什么会放弃?因为我们下意识中会对所面临的困难以及成功后所得的收益作一个评估(经典的cost/return分析),这里特别重要的是对面临的困难的评估:我们都知道学习任何一门技能,一开始可能还兴趣浓厚,捋袖子上阵,过了一阵子便会遇到一个典型的分水岭,你会发现未知的东西比你想象得要多,困难重重,似乎一眼看过去没法确信什么时候才能掌握,甚至觉得有点Mission Impossible,当觉知到的困难到一定程度之后,我们的大脑便会想:既然很大可能最终失败,甚至看不到成功的可能,为什么要白费力气去学一通呢?还不如省省呢。这是一个聪明的经济决策,去权衡性价比应该是每个经济个体的原则。然而,这个决策笨就笨在,它把困难评估得过高了,因此决策的前提就弄错了。为什么这么说呢?
- [BetterExplained]为什么你应该(从现在开始就)写博客
- 用一句话来说就是,写一个博客有很多好处,却没有任何明显的坏处。(阿灵顿的情况属于例外,而非常态,就像不能拿抽烟活到一百岁的英国老太太的个例来反驳抽烟对健康的极大损伤一样)
让我说得更明确一点:用博客的形式来记录下你有价值的思考,会带来很多好处,却没有任何明显的坏处。Note:碎碎念不算思考、心情琐记不算思考、唠唠叨叨也不算思考、没话找话也不算思考,请以此类推。
下面是我个人认为写一个长期的价值博客的最大的几点好处:
1) 能够交到很多志同道合的朋友。我自己既写博客,也读别人的博客,在这个时代,对于生活中的绝大多数人来说,拓宽朋友圈子的途径几乎只有一个,通过网络,而如何在网络中寻找到气味相投的朋友,如何判断别人和自己是否有共同语言?显然,通过天天在SNS上碎碎念的那些日记是难以做到的。我佩服的一些朋友几乎全都是长期用博客记录想法的人,因此,和他们即便不打照面,也是心照不宣。即便素未谋面也能坐下来就聊得热火朝天。
为什么博客在结交志同道合的朋友方面的潜力要远胜于原始的交谈方式?很简单,第一,博客无地域限制,整个互联网上从A到B只有一个点击的距离,而传统的建立朋友圈子的方法则受到地域限制。第二,也是更重要的一点,即如果按照以前结交朋友的方式,需要互相聊天,交流观点,然后才逐渐熟悉起来,这需要一个较长的过程,而且更糟糕的是,当你遇到另一个陌生人,又要把整个过程重复一次,表达你已经对老友表达过的那番想法。可博客却做到了“一次表达,无数次阅读”,当我看到一个写了好几年的博客,看完了之后我仿佛和这个人交谈了很久,用程序员们喜欢听的话来说就是,“博客极大地增强了话语的复用性”。
我曾在CSDN上写了近六年的博客,在一年半前建立了一个Google Groups(TopLanguage),由于我的博客的长期阅读者都是互相有共同语言的,因此这个Group一开始就热火朝天,而高质量的技术讨论则进一步吸引了更多的牛人的参与,雪球滚起来之后,就很难停下来了,将近一年半下来,从这个Group的讨论中我获益良多[1]。而对于非程序员朋友,科学松鼠会则是一个很好的例子。
- [BetterExplained]书写是为了更好的思考
- 我经常在走路和睡前总结所学过的内容,思考遗留的问题,一段时间的阅读和思考之后,一个总体的知识框架就会逐渐浮现在脑海中。然后我会将它书写下来,然而,我往往非常惊讶地发现,当我书写的时候,新的内容仍然源源不断的冒出来,就像我的键盘自己也会思考一样。
大半年前的时候,我曾在一篇文章《跟波利亚学解题》中写到将问题求解的思维过程记录下来的好处,现在再次回忆起来,当时列出的几点其实不仅对于问题求解是大有好处,对于平时的思考也是同样的道理。
书写的好处有以下几点:
- 独立日
- Mind Hacks, http://mindhacks.cn @ 2/7/2009
前生:C++的罗浮宫@CSDN
简史:2003 年 8 月第一篇博客,最初几年关注C++,后依次关注算法、人工智能、思维与认知科学。
数据:五年零六个月。发文 119 篇。其中原创 111 篇,翻译 8 篇,转载 0 篇。访问量 一百二十万,评论数 1984 (很巧的是,这是我的出生年)
- 机器学习与人工智能学习资源导引
- 我经常在 TopLanguage 讨论组上推荐一些书籍,也经常问里面的牛人们搜罗一些有关的资料,人工智能、机器学习、自然语言处理、知识发现(特别地,数据挖掘)、信息检索 这些无疑是 CS 领域最好玩的分支了(也是互相紧密联系的),这里将最近有关机器学习和人工智能相关的一些学习资源归一个类
- 一直以来伴随我的一些学习习惯(一):学习与思考
- 1. Google&Wiki(遇到问题做的第一件事情,也是学习某个东西做功课(homework)最先用到的东西。
2. 看书挑剔,只看经典。如何选择经典,可以到网上做做功课,看看评价,综合分析一下。
3. 做读书笔记。一是将自己阅读的时候的思考(包括闪念)总结下来,二是将书中的好例子摘抄下来。(这个习惯是一年前才养成的,发现受益极大。)有了google note,笔记可以加上tag,非常便于回顾,加深理解。我觉得,人与人学习的差距不在资质上,而在花在思考的时间和思考的深度上(后两者常常也是相关的)。
4. 提到思考,我有一个小习惯。利用走路和吃饭的时候思考,还有睡觉前必然要弄一个问题放在脑子里面,在思考中迷糊入睡。发现这样一来往往在不知不觉中多出来大量的思考时间。
- 学习与记忆
- 我李敖看的书很少会忘掉,什么原因呢?方法好。什么方法?心狠手辣。剪刀美工刀全部下来,把书给分尸掉了,就是切开了。这一页我需要,这一段我需要,我把它分类分出来了。那背面有怎么办呢?把它影印出来,或者一开始就买两本书,把两本书都切开以后排出来,把要看的部分切开。结果一本书看完了,这本书也被分尸掉了。这就是我的看书方法。
那分类怎么分呢?我有很多自己做的夹子,夹子我写上字,把资料全部分类。一本书看完以后,全部进入我的夹子里面了。我可以分出几千个类来,分的很细。好比说按照图书馆的分类,哲学类,宗教类;宗教类再分佛教类、道教类、天主教类。我李敖分的更细了,天主教还可以分,神父算一类。神父还可以细分,神父同性恋就是一类,神父还俗又是一类。修女同性恋是一类,修女还俗这又是一类。
任何书里有关的内容都进入我的资料里来。进入干什么呢?当我要写小说的时候,需要这个资料,打开资料,只是写一下就好了。或者发生了一个什么事件,跟修女同性恋有关系,我要发表对新闻的感想,把新闻拿过来,我的资料打开,两个一合并,文章立刻就写出来了。
换句话说,我这本书看完之后,被我大卸八块,五马分尸。可是被我勾住了,这些资料我不凭记忆来记它,我凭用细部的很耐心的功夫把它勾紧,放在资料夹子里。我的记忆力只要记这些标题就好了。标题是按照我的习惯来分,基本上都翻译成英文字,用英文字母排出来,偶尔也有些中文的。
今天我把看家的本领告诉大家,李敖知道的那么多,博闻强记,记忆力那么好。我告诉大家,记忆力是可以训练的。记忆力一开始就是你不要偷懒,不要说躺在那里看书,看完了这本书还是干干净净的,整整齐齐的,这不对。看完了这本书,这本书就大卸八块,书进了资料夹,才算看完这本书。
今天我为大家特别亮一手,把如何看书的招告诉大家。不要以为这本书看完了,干干净净的新的算看过。那个不算看过,因为当时是看过,可是浪费了。你不能够有系统的扣住这些资料,跟资料挂钩。可是找我这个方法,可以把你看过的书,都把它的精华抓出来,扣在一起。这就是我的这种土法炼钢的治学方法。
- 阅读与思考
- 阅读的方法
读的时候有轻有重,有的地方快,有的地方慢,具体哪些地方快哪些慢我一时也整理不出来什么法则(可以参考《如何阅读一本书》)。
举一个例子:以前我读书是流水帐式的,现在我一定会先把目录很仔细的看一看,目录往往包含了最高层的知识结构,然后我会挑选看上去最有趣的部分阅读,如果发现需要用到前面的内容就跳到前面补充一下。一般来说,最有趣的部分读完之后,其余部分也就不那么紧急了,大可以轻松地看一看。
此外边读边思考的习惯有助于加深印象;看到觉得重要的地方,要随手做笔记,就算以后不看自己的笔记,单单是记下来就能极大加深思考。
有的书整个就可以略读,因为其中有意义的地方并不很多(但又不能绝对不读,因为毕竟还有一些重要的东西),譬如《专注力》我花了不到两个小时读完了,主要是看里面的一些例子,作者的解释我发现不需要细看,有了例子自己就可以分析,没有作者的解释先入为主反而可以分析得更彻底些。另一方面,《社会性动物》就花了好几天,因为里面的思辨密度很高,值得仔细分析甚至参与作者的思考。
- Failing To See the Big Picture – Mistakes we make when learning programming
- Let’s start with an obvious fact:
The Inconvenient Human Nature, #1
People are inherently more easily attracted by “interesting” (as opposed to “mundane”) things. (We will define “interesting” in the later parts)
What can we derive from this simple axiom?
A lot of things. But since we’re talking about learning programming, we shall focus mainly on the implications it has for how we learn programming.
Programming, the interesting and the mundane
- 数学之美番外篇:进化论中的概率论
- 偶然性在进化中确实存在(例如,偶然性的突变可以产生新的特征),但是进化并不依赖偶然性来产生新的器官、蛋白质或其他实体。截然相反的是,自然选择,作为进化中已知的最主要机制,却会明确保留“需要的”(能适应的)特性,消除“不需要的”(无法适应的)特性。只要选择的影响力存在,自然选择就能把进化向一个方向推进,在出乎意料的短时间内产生复杂的结构。举个例子,现有由13个字母构成的序列“TOBEORNOTTOBE”,假设有几百万只猴子,每只猴子每秒钟挑一条短语,需要78,800年才能从26^13种可能中选出这样的排列。不过,Glendale College的Richard Hardison在20世纪80年代写过一个程序,它能够在随机产生序列的同时,保证那些已经出现在正确位置上的字母不会变化(这样做倒有点《汉姆雷特》 的味道。译注:这个句子看了大半天才明白,嘿嘿)。这个程序平均只需要336次迭代就能生成上文提到的短语,时间少于90秒。更神奇的是,把莎士比亚的整个剧本重新生成一遍也只需要四天半时间。
- uniplate: Help writing simple, concise and fast generic operations. | Hackage
-
- Uniplate - HaskellWiki
-
- model of type theory in an (infinity,1)-topos in Homotopy Type Theory
-
- Conceptual Mathematics: A First Introduction to Categories: F. William Lawvere, Stephen H. Schanuel: 9780521719162: Amazon.com: Books
- Conceptual Mathematics: A First Introduction to Categories [F. William Lawvere, Stephen H. Schanuel] on Amazon.com. *FREE* shipping on qualifying offers. In the last 60 years, the use of the notion of category has led to a remarkable unification and simplification of mathematics. Conceptual Mathematics
- sintzoff-wmt.pdf
-
- PPP paper - PPP.pdf
-
- Microsoft PowerPoint - wile.ppt - wile.pdf
-
- talk.dvi - gibbons-folds.pdf
-
- Getting Values Out of Monads - Chris Taylor
- Monads as used in functional programming are ‘one way’. The monad type class provides a way to put values into the monad (with return) …
- Trees and Readers - Chris Taylor
- In this post I want to explain the relationship between trees and the reader monad. In particular, how trees generalize readers. Consider the type of …
- Polyvariadic Functions and Printf - Chris Taylor
- Most languages have some form of printf function that lets you print formatted strings. In Python it looks like this 1
print "The %s river is %d …
- The Algebra of Algebraic Data Types, Part 3 - Chris Taylor
- I gave a talk on this subject at London Haskell in November 2012. A video of the talk is on YouTube and slides are on GitHub. This is Part 3 in a …
- Intuitionistic Programming Language
-
- Treatise on Intuitionistic Type Theory | Johan Georg Granström | Springer
- Intuitionistic type theory can be described, somewhat boldly, as a fulfillment of the dream of a universal language for science. In particular,
- Straitjacket programming : Inside 736-131
-
- Generic Haskell publications/papers
-
- Glitch: A Live Programming Model | Lambda the Ultimate
-
- The Incremental λ-Calculus and Relational Parametricity
-
- Shirky: A Group Is Its Own Worst Enemy
- Clay Shirky's writings about the Internet, including Economics and Culture, Media and Community, Open Source
- Viewpoints Research Institute
-
- tr2014002_babelsberg.pdf
-
- The Spirit of LtU | Lambda the Ultimate
-
- Programming Languages Will Become OSes (But Are Not Quite Yet)
- OSNews is Exploring the Future of Computing with news on desktop, server, mobile, and specialty operating systems and new computing technology.
- Lightweight Languages 2002 (LL2)
-
- Introducing Incremental :: Jane Street Tech Blogs
-
- あおい@RT数アリス(6/54) (@wobumi) | Twitter
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Joel on Software
-
- Unqualified Reservations: Wolfram Alpha and hubristic user interfaces
-
- Unqualified Reservations
-
- CiteSeerX — Subtyping Constrained Types
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): A constrained type is a type that comes with a set of subtyping constraints on variables occurring in the type. Constrained type inference systems are a natural generalization of Hindley/Milner type inference to languages with subtyping. This paper develops several subtyping relations on polymorphic constrained types of a general form that allows recursive constraints and multiple bounds on type variables. We establish a full type abstraction property that equates a novel operational notion of subtyping with a semantic notion based on regular trees. The decidability of this notion of subtyping is open; we present a decidable approximation. Subtyping constrained types has applications to signature matching and to constrained type simplification. The relation will thus be a critical component of any programming language incorporating a constrained typing system. 1 Introduction A constrained type is a type that is additionally constrained by a set of subtyping constraints on the free ty...
- http://cristal.inria.fr/attapl/
-
- CiteSeerX — Type Inference with Structural Subtyping: A faithful formalization of an efficient constraint solver
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): We are interested in type inference in the presence of structural subtyping from a pragmatic perspective. This work combines theoretical and practical contributions: first, it provides a faithful description of an efficient algorithm for solving and simplifying constraints; whose correctness is formally proved. Besides, the framework has been implemented in Objective Caml, yielding a generic type inference engine. Its efficiency is assessed by a complexity result and a series of experiments in realistic cases.
- CiteSeerX — Type inference with constrained types
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): We present a general framework HM(X) for type systems with constraints. The framework stays in the tradition of the Hindley/Milner type system. Its type system instances are sound under a standard untyped compositional semantics. We can give a generic type inference algorithm for HM(X) so that, under sufficient conditions on X, type inference will always compute the principal type of a term. We discuss instances of the framework that deal with polymorphic records, equational theories and subtypes.
- Trivium
-
- Dadhacker | Instant Wisdom Worth What You Paid
-
- MenTaLguY's page
-
- An explorer's log
-
- Factor: a practical stack language
-
- Arcane Sentiment
-
- The Blogging of Prolog | And other logical excursions
- And other logical excursions
- Conal Elliott
-
- λ Tony's blog λ - Home
-
- Kazimir Majorinc's Lisp Programming Blog.
-
- This FTP site
- Main index of okmij.org
- Loper OS
-
- The Racket Blog
-
- Ola Bini: Programming Language Synchronicity
-
- raganwald-deprecated/homoiconic: An experiment in publishing code and words about code on a small scale.
- homoiconic - An experiment in publishing code and words about code on a small scale.
- Philip Guo - The Two Cultures of Computing
-
- Philip Guo - Category - programming
-
- Philip Guo - Category - CS Education
-
- Philip Guo - Category - how-to
-
- Philip Guo - Category - productivity
-
- Philip Guo - Category - personal
-
- Philip Guo - Category - computing
-
- Philip Guo - Category - undergrad education
-
- Philip Guo - Category - education
-
- Philip Guo - Category - teaching
-
- Philip Guo - Category - guest article
-
- Philip Guo - Category - human computer interaction
-
- Publications & Talks | Gregory Malecha
- I do research on programming languages, program verification, compilers, and program analysis.
- Microsoft Word - p775-wilson.doc - chi03-curiosity.pdf
-
- Unknown - CS-TR-73-382.pdf
-
- Complexity_Science_in_Brief.pdf
-
- Complex systems - Wikipedia, the free encyclopedia
-
- Complexity Science
-
- 7LT;01Mar01 - Phelan_What is complexity science.pdf
-
- Galois Theory by Ian Stewart - Google Search
-
- Mathematics, Form and Function by Saunders MacLane - Google Search
-
- The Structure of Scientific Revolutions by Thomas Kuhn - Google Search
-
- Visual Complex Analysis by Tristan Needham - Google Search
-
- Term Rewriting and all That by Franz Baader - Google Search
-
- 14num.pdf
-
- Superoptimizer: a look at the smallest program
-
- Logic: Wilfrid Hodges: 9780141003146: Amazon.com: Books
- Logic [Wilfrid Hodges] on Amazon.com. *FREE* shipping on qualifying offers. <div>If a man supports Arsenal one day and Spurs the next, then he is fickle but not necessarily illogical. From this starting point
- UCL - Département d'Ingénierie Informatique - Peter Van Roy
-
- Syntax and Semantics of Programming Languages
-
- Sometimes all functions are continuous | Mathematics and Computation
-
- notions1.pdf
-
- [Haskell-cafe] about Haskell code written to be "too smart"
-
- [Haskell-cafe] about Haskell code written to be "too smart"
-
- [Haskell-cafe] Indentation Creep
-
- [Haskell-cafe] Indentation Creep
-
- [Haskell-cafe] Indentation Creep
-
- [Haskell-cafe] Indentation Creep
-
- Large-Scale Organizational Computing Requires Unstratified Reflection and Strong Paraconsistency - Springer
-
- Title - chp%3A10.1007%2F978-3-540-79003-7_9.pdf
-
- https://www.haskell.org/onlinereport/haskell2010/
-
- Typeclassopedia - HaskellWiki
-
- IdiomLite.pdf
-
- Kleisli.pdf
-
- A Neighborhood of Infinity: From Monoids to Monads
-
- Simon Peyton Jones: papers
- Simon Peyton Jones: papers
- Conal Elliott » Beautiful differentiation
-
- The Implementation of Functional Programming Languages
-
- DGP-Intro.pdf
-
- jfp-outsidein.pdf
-
- Making it stick.: August 03, 2003
-
- The Best Software Writing I: Selected and Introduced by Joel Spolsky: Avram Joel Spolsky: 0689253595008: Amazon.com: Books
- The Best Software Writing I: Selected and Introduced by Joel Spolsky [Avram Joel Spolsky] on Amazon.com. *FREE* shipping on qualifying offers. It's nice having a collection of high-quality writing related to software and the business in one place instead of trawling the Web for it. Meryl K. Evans
- Polymorphic effect systems
- Polymorphic effect systems on ResearchGate, the professional network for scientists.
- Andrew D. Gordon: Details of Publications
-
- Stack Inspection: Theory and Variants - MSR-TR-2001-103.pdf
-
- Haskell is not not ML
-
- Continuation of Discussion: "Mathematics self-proves its own Consistency (contra Gödel et. al.)" | Lambda the Ultimate
-
- Inconsistency Robustness in Foundations: Mathematics self-proves its own Consistency and Other Matters - Google Drive
-
- Inconsistency Robustness in Logic Programs | Lambda the Ultimate
-
- computational trinitarianism in nLab
-
- Gendered Language: Feature or Bug in Software Documentation? by Tim Chevalier | Model View Culture
- Model View Culture
- Two Adaptive Logics of Norm-Propositions | Mathieu Beirlaen - Academia.edu
- By Mathieu Beirlaen in Conflicts of Law and Non-monotonic Logic. We present two defeasible logics of norm-propositions (statements about norms) that (i) consistently allow for the possibility of normative gaps and normative conflicts, and (ii) map
- An Andersonian deontic logic with contextualized sanctions | Christian Straßer and Mathieu Beirlaen - Academia.edu
- By Christian Straßer and Mathieu Beirlaen in Deontic Logic and Paraconsistent logic. We present a refinement of Anderson’s reduction of deontic logic to modal logic with only alethic modalities. The refined proposal contextualizes the Andersonian
- Gaps and Gluts in Semantic Models of Vagueness | David Van Bruwaene - Academia.edu
- By David Van Bruwaene in Vagueness and Paraconsistent logic.
- LOGIC FOR MATHEMATICS AND COMPUTER SCIENCE
-
- HaltingProblem/proof6.agda at master · ZongzheYuan/HaltingProblem
- HaltingProblem - The proof of undecidability of halting problem, using the model -- WHILE language.
- reperiendi | Mike Stay
- Mike Stay (by Mike Stay)
- めらみぽっぷ - The beautiful world (附中譯歌詞/English Subed/歌詞付き) - YouTube
- The beautiful world 魔術師メリー|蓮台野夜行 ネクロファンタジア|東方妖々夢 Vocal: めらみぽっぷ Arrangement+Lyrics: RD-Sounds Circle: 凋叶棕 (RD-Sounds) Album: 辿 -tadori- Event: C83 Image used:...
- 【東方ボーカル】 「somewhat trustworthy」 【凋叶棕】 - YouTube
- ◊ Title: somewhat trustworthy ◊ Vocal: めらみぽっぷ ◊ Arrangement: RD-Sounds ◊ Lyric: RD-Sounds ◊ Circle: 凋叶棕 ◊ Album: 東方幻奏響UROBOROS参~とある魔法と幻想の無限螺旋~ ◊ Release Date...
- 【東方ボーカル】 「true outsiders」 【凋叶棕】 - YouTube
- ◊ Title: true outsiders ◊ Vocal: めらみぽっぷ, nayuta ◊ Arrangement: RD-Sounds ◊ Lyric: RD-Sounds ◊ Circle: 凋叶棕 ◊ Album: 喩 (Metaphor) ◊ Release Date: Aug 14, 2015 ...
- The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions (Dover Books on Mathematics): Martin Davis: 0000486432289: Amazon.com: Books
- The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions (Dover Books on Mathematics) [Martin Davis] on Amazon.com. *FREE* shipping on qualifying offers. <div><P> A valuable collection both for original source material as well as historical formulations of current problems. — <I>The Review of Metaphysics<BR></I> Much more than a mere collection of papers. A valuable addition to the literature. — <I>Mathematics of Computation<BR></I>An anthology of fundamental papers on undecidability and unsolvability by major figures in the field
- alexjc/neural-doodle: Turn your two-bit doodles into fine artworks with deep neural networks! An implementation of Semantic Style Transfer.
- neural-doodle - Turn your two-bit doodles into fine artworks with deep neural networks! An implementation of Semantic Style Transfer.
- Neural Doodles: Workflows for the Next Generation of Artists | nucl.ai
-
- Deep Learning Summer School 2016
-
- Machine Learning Summer Schools - MLSS
-
- What do you guys think of Shen? : lisp
- http://shenlanguage.com From what I know about prog langs, Shen seems to be the most advanced. It feels like a lisp with just the right about of...
- Deep Learning Summer School 2016
-
- Self-explaining computation | dynamic aspects
-
- Home : Inform
-
- 「東方幻奏響UROBOROS参」「東方幻奏響Revival弐」
-
- Flavours of free applicative functors
-
- Homotopy - Wikipedia, the free encyclopedia
-
- CiteSeerX — The mini-workshop The Homotopy Interpretation of Constructive Type Theory,
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract. Over the past few years it has become apparent that there is a surprising and deep connection between constructive logic and higherdimensional structures in algebraic topology and category theory, in the form of an interpretation of the dependent type theory of Per Martin-Löf into classical homotopy theory. The interpretation results in a bridge between the worlds of constructive and classical mathematics which promises to shed new light on both. This mini-workshop brought together researchers in logic, topology, and cognate fields in order to explore both theoretical and practical ramifications of this discovery.
- Stevey's Blog Rants: Haskell Researchers Announce Discovery of Industry Programmer Who Gives a Shit
-
- [1509.01549] Giraffe: Using Deep Reinforcement Learning to Play Chess
-
- flannelhead's lab - Blackstar
-
- The Incredible Proof Machine
-
- http://bentnib.org/docs/natural-deduction.html
-
- Bob Atkey
-
- Mind Hacks 的含义
- 刘未鹏(pongba) 域名 MindHacks.cn 的含义: Mind Hacks 是一本书 Mind Hacks 是一系列思维工具 Mind Hacks 有一个漫长的前生——一个有着近6年历史的技术博客,在CSDN上有超过一百二十万的访问量,详见《前世档案|C++的罗浮宫》 Mind Hacks 的博客作者创建了 TopLanguage:https://groups.google.com/group/pongba http://mindhacks.cn @ 2/7/2009
- Imperative vs Functional Programming | Apocalisp
- Recently I had a quasi-private discussion about philosophy in programming where somebody asked a question about functional programming. I'd like to relay part of the discussion here since it might be of interest to the community at large. Jason wrote: I have come out strongly in support of OO, and I think it has a…
- Some Notes in Hostility Toward Subtyping | Apocalisp
- What follows is a session of thinking out loud, so it's not to be taken too seriously. The more I think about it, the more I convince myself that the idea of subtyping and class hierarchies is a mistake. "Inheritance" is a good way to lock down a design so that it becomes rigid and…
- A Critique of Impure Reason - Higher Order
- Much has been made of the difference between “object-oriented” and “functional” programming. As much as I’ve seen …
- trampolines.pdf
-
- Wadler: Parametricity
-
- Quantropy (Part 2) | Azimuth
- In my first post in this series, we saw that filling in a well-known analogy between statistical mechanics and quantum mechanics requires a new concept: 'quantropy'. To get some feeling for this concept, we should look at some examples. But to do that, we need to develop some tools to compute quantropy. That's what we'll…
- Azimuth
-
- myth.dvi - myth.pdf
-
- paper.dvi - its.pdf
-
- Mesa (programming language) - Wikipedia, the free encyclopedia
-
- On Complete Functional Synthesis (PDF Download Available)
- Official Full-Text Publication: On Complete Functional Synthesis on ResearchGate, the professional network for scientists.
- Philippe Suter
-
- Complete functional synthesis | DeepDyve
- Read "Complete functional synthesis" on DeepDyve - Instant access to the journals you need!
- MirahFeatures
-
- Katahdin
-
- objmlcoq.pdf
-
- ATS (programming language) - Wikipedia, the free encyclopedia
-
- ATS: Programming with Theorem-Proving - Wikibooks, open books for an open world
-
- Theorem-Proving in ATS/LF
-
- CS3 Language Semantics and Implementation
-
- sempl.pdf
-
- Semantics with Applications
-
- 21173011.pdf
-
- Visual Languages: Course on Graph and Model transformation
-
- Visual Languages: Practical on Graph and Model transformation
-
- Visual Languages: VlDesk
-
- Visual Languages: Hyperedge Replacement Graph Grammars
-
- Visual Languages: EMF and MOF
-
- Ambiata Engineering Blog
-
- A++ [Eric Torreborre's Blog]: specs2-three
-
- A++ [Eric Torreborre's Blog]: Commando programming
-
- ICFP Programming Contest 2015
-
- A++ [Eric Torreborre's Blog]: Less is more, slow is fast (expensive is cheap?)
-
- A++ [Eric Torreborre's Blog]: Net pearls
-
- Martin Fowler
-
- paper.dvi - asplos06-final.pdf
-
- Combinatorial sketching for finite programs | DeepDyve
- Read "Combinatorial sketching for finite programs" on DeepDyve - Instant access to the journals you need!
- Sanjit Seshia's Publications combinatorial sketching for finite programs
-
- fpottier-appsem-2005.pdf
-
- Disjoin: Decision at a Distance | Awelon Blue
- The disjoin and conjoin behaviors in RDP are the two primitives that connect sums and products: disjoin :: (x :&: (y :|: z)) ~> ((x :&: y) :|: (x :&: z)) conjoin :: ((x :&: y) :|: (x :&: z)) ~> (x :&: (y :|: z)) The disjoin behavior means that we can take a…
- acid-state: Add ACID guarantees to any serializable Haskell data structure. | Hackage
-
- Tuple space - Wikipedia, the free encyclopedia
-
- Some concepts behind hvac | fmap fix return
- Having written the hvac and HStringTemplate libraries, I need to get around to documenting them better, not to mention polishing hvac up for a hackage release. But in the meantime, by way of introduction to (hopefully) a series of tutorials, I figured I'd go through some of the basic principles behind what I've been doing.…
- Simple Extensible Records — Quick Generic Tricks, Pt. 1 | fmap fix return
- There have been a few discussions lately about how to do quick and easy typesafe extensible records in Haskell. And there have been a number of discussions lately about extensions to do it more cleanly (see, e.g. this one on haskell-cafe). This came up on the channel the other day and somebody immediately suggested HList,…
- Turtles all the way. | fmap fix return
- HStringTemplate had a very irritating hack in it up until about twenty minutes ago. Every time we worked with some of StringTemplate's fancier constructs, particularly chaining template application (i.e. $foo:bar():baz():etc()$ which applies foo to bar, feeds it to baz, then feeds it in turn to etc) or using a template as an attribute (i.e. ${$foo$}$…
- HStringTemplate: An Elegant, Functional, Nifty Templating Engine for Haskell. | fmap fix return
- HStringTemplate is a port of Terrence Parr's lovely StringTemplate engine to Haskell. It is available, cabalized, at: darcs get http://code.haskell.org/HStringTemplate/ As interest has grown in using Haskell for web applications, there has been an increasing buzz about the need for a good templating engine in Haskell. Why might we need this? After all, Haskell has…
- compilation-agay.pdf
-
- LtU Classic Archives
-
- plwonks
- A collection of programming language enthusiasts from Indiana University.
- stop2015/dtr-stop2015.pdf at master · andmkent/stop2015
- Contribute to stop2015 development by creating an account on GitHub.
- Two Studies of Opportunistic Programming: Interleaving Web Foraging, Learning, and Writing Code - brandt_chi09_webuse.pdf
-
- A Neighborhood of Infinity: Data and Codata
-
- 18.S996S13 Textbook: Category Theory For Scientists - MIT18_S996S13_textbook.pdf
-
- Abstract and Concrete Categories
-
- CTCL.pdf
-
- Index of /course/80-413-713/notes
-
- categorynotes-cheng.pdf
-
- tr22.pdf
-
- book.pdf
-
- User:Michiexile/MATH198 - HaskellWiki
-
- 「ビクセノ」 's Works - Illustration [pixiv]
- pixiv is an online artist community where members can browse and submit works, join official contests, and collaborate on works with other members.
- [1512.01895] Modular implicits
-
- ml2014.pdf
-
- Reflection
- Online bibliography of Scheme research
- Mini-Bibliography on Modules for Functional Programming Languages
- Mini-Bibliography on Modules for Functional Programming Languages
- Reading list on XML and Web Programming
- Online bibliography of Scheme research
- "Screw it, I'll make my own!" - The story of a new programming language
-
- D-Expressions
-
- Hidden Algebra
-
- katahdin.pdf
-
- oopsla13.pdf
-
- Inductive Invariant Generation via Abductive Inference - oopsla2013-talk.pdf
-
- c2i.pdf
-
- invariants_dt.pdf
-
- Lemma Learning in SMT on Linear Constraints - Springer
-
- 107.pdf
-
- () - lpar2008.pdf
-
- Alloy
-
- SauceNAO Image Search
-
- botea05a.dvi - 1109.2154.pdf
-
- PII: 0304-3975(75)90017-1 - cbn_cbv_lambda.pdf
-
- On the criteria to be used in decomposing systems into modules
-
- From system F to typed assembly language
-
- Subgoal induction
-
- The next 700 programming languages
-
- A unified approach to global program optimization
-
- Proof of correctness of data representations - Springer
-
- Abstract interpretation
-
- Customization: optimizing compiler technology for SELF, a dynamically-typed object-oriented programming language
-
- Type Systems.fm - typesystems.pdf
-
- Type hackery for the practical programmer pt. II | fmap fix return
- This post is a long time coming, and sort of anti-climactic, but I wanted to just finish off what I'd begun describing in the previous post. We have, if you will recall: class MapFromTuple a b where mapFromTuple :: a -> [b] This is our handy way to marshal a heterogenous tuple into a uniformly-typed…
- Type-hackery for the practical programmer | fmap fix return
- So hvac has a pretty nice validation framework built on the withSomething idiom (i.e. withSomething (\something -> etc)) which is a sort of continuation passing model. More particularly, it has: withValidation :: [(String, ValidationFunc s String String)] -> ([String] -> HCGI q s CGIResult) -> HCGI q s CGIResult. This is to say that it…
- Tutorials and Surveys
- Online bibliography of Partial Evaluation research
- Theory and Techniques
- Online bibliography of Partial Evaluation research
- Partial Evaluators for the Lambda Calculus
- Online bibliography of Partial Evaluation research
- Partial Evaluators for Scheme and Functional Programming Languages
- Online bibliography of Partial Evaluation research
- Partial Evaluators for C and Imperative Languages
- Online bibliography of Partial Evaluation research
- Partial Evaluators for Java and Object-Oriented Languages
- Online bibliography of Partial Evaluation research
- Techniques and Implementations of Logic Program Specialization
- Online bibliography of Partial Evaluation research
- Applications of Partial Evaluation
- Online bibliography of Partial Evaluation research
- Boomerang: A bidirectional programming language for ad-hoc data
-
- Amazon.com: Introduction to Mathematical Thinking eBook: Keith Devlin: Kindle Store
- Introduction to Mathematical Thinking - Kindle edition by Keith Devlin. Download it once and read it on your Kindle device, PC, phones or tablets. Use features like bookmarks, note taking and highlighting while reading Introduction to Mathematical Thinking.
- A Computational Introduction to Number Theory and Algebra
-
- Advanced Modern Algebra - Advanced Modern Algebra - Joseph J. Rotman.pdf
-
- ocaml.pdf
-
- phd-thesis.pdf
-
- wiley.pdf
-
- 1990sml.pdf
-
- 1991commentaryBody.pdf
-
- A Tutorial Implementation of a Dependently Typed Lambda Calculus
-
- LambdaPi.pdf
-
- Minicourse on Homotopy Type Theory, April 10–13, 2012
-
- 15-819 Homotopy Type Theory
- Carnegie Mellon Homotopy Type Theory Course
- Algebraic Topology Book
- A downloadable textbook in algebraic topology
- paramore - star
-
- playground/typeClass.sml at master · steshaw/playground
- Steve's code playground
- modules-classes.pdf
-
- Stefan Wehr
-
- Derek Dreyer
-
- Scott Kilpatrick // MPI-SWS
-
- MixML - Mixin' Up the ML Module System
- Be declarative. Be functional. Just be.
- TypeClasses.pdf
-
- pldi12a.pdf
-
- kuan-dissertation.pdf
-
- George Kuan
- Personal Homepage of Programming Languages Researcher and Hacker George Kuan
- George Kuan | LinkedIn
- View George Kuan’s professional profile on LinkedIn. LinkedIn is the world's largest business network, helping professionals like George Kuan discover inside connections to recommended job candidates, industry experts, and business partners.
- [TYPES] A show-stopping problem for modular type classes?
-
- A show-stopping problem for modular type classes?
-
- A show-stopping problem for modular type classes?
-
- Practical Generic Programming with OCaml - yallop-ml07.pdf
-
- Orphan instance - HaskellWiki
-
- Partial Revelation and Modula-3
-
- Design Concepts in Programming Languages | Web Supplement | Home
-
- Compiling with Continuations | Programming Languages and Applied Logic | Cambridge University Press
- This book shows how continuation-passing style is used as an intermediate representation on which to perform optimisations and program transformations.
- Modern Compiler Implementation in ML
-
- The Algebra of Programming (Prentice-Hall International Series in Computer Science): Richard Bird, Oege de Moor: 9780135072455: Amazon.com: Books
- Buy The Algebra of Programming (Prentice-Hall International Series in Computer Science) on Amazon.com ✓ FREE SHIPPING on qualified orders
- PLT by steshaw
-
- Classic Papers in Programming Languages and Logic
-
- Visualization : Inside 736-131
-
- Ur/Web : Inside 736-131
-
- Toolbox : Inside 736-131
-
- Teaching : Inside 736-131
-
- Software Engineering : Inside 736-131
-
- Society : Inside 736-131
-
- SIPB : Inside 736-131
-
- Scheme : Inside 736-131
-
- Rust : Inside 736-131
-
- Radio : Inside 736-131
-
- Programming Languages : Inside 736-131
-
- Philosophy : Inside 736-131
-
- Personal : Inside 736-131
-
- Open Source : Inside 736-131
-
- OCaml : Inside 736-131
-
- Music : Inside 736-131
-
- Miscellaneous : Inside 736-131
-
- Meta : Inside 736-131
-
- Logic : Inside 736-131
-
- Math : Inside 736-131
-
- Mailbox : Inside 736-131
-
- HTML Purifier : Inside 736-131
-
- Space Leak : Inside 736-131
-
- Haskell Heap : Inside 736-131
-
- c2hs : Inside 736-131
-
- Backpack : Inside 736-131
-
- Haskell : Inside 736-131
-
- Hack : Inside 736-131
-
- Guest : Inside 736-131
-
- Git : Inside 736-131
-
- Hoopl : Inside 736-131
-
- GHC : Inside 736-131
-
- Galois Tech Talk : Inside 736-131
-
- Frivolity : Inside 736-131
-
- Finance : Inside 736-131
-
- Cryptography : Inside 736-131
-
- Coq : Inside 736-131
-
- Concurrency : Inside 736-131
-
- Denotational Semantics : Inside 736-131
-
- Computer Science : Inside 736-131
-
- Agda : Inside 736-131
-
- Software Analysis and Transformation | CWI Amsterdam | Research in mathematics and computer science
-
- The Extended Phenotype: The Long Reach of the Gene (Popular Science), Richard Dawkins, Daniel Dennett, eBook - Amazon.com
- The Extended Phenotype: The Long Reach of the Gene (Popular Science) - Kindle edition by Richard Dawkins, Daniel Dennett. Download it once and read it on your Kindle device, PC, phones or tablets. Use features like bookmarks, note taking and highlighting while reading The Extended Phenotype: The Long Reach of the Gene (Popular Science).
- yield.subc.pdf
-
- Programming with Algebraic Effects and Handlers | Mathematics and Computation
-
- Generators: yield = exceptions + non-determinism
- Tracing the origins of generators and relating them to lazy lists, non-determinism, LogicT, and zippers.
- 1410.0198v3.pdf
-
- Kaggle: The Home of Data Science
- Kaggle is a platform for data prediction competitions. Companies, organizations and researchers post their data and have it scrutinized by the world's best statisticians.
- nc.dvi - Hochreiter97_lstm.pdf
-
- 43905.pdf
-
- LSTM Networks for Sentiment Analysis — DeepLearning 0.1 documentation
-
- Scene Labeling With LSTM Recurrent Neural Networks - Byeon_Scene_Labeling_With_2015_CVPR_paper.pdf
-
- phd.pdf
-
- Reinforcement Learning with Long Short-Term Memory - 1953-reinforcement-learning-with-long-short-term-memory.pdf
-
- Sequence to Sequence Learning with Neural Networks - 5346-sequence-to-sequence-learning-with-neural-networks.pdf
-
- gers02a.pdf
-
- Demystifying LSTM neural networks
-
- [1507.06527] Deep Recurrent Q-Learning for Partially Observable MDPs
-
- Scalable Neural Networks for Board Games - mdlstm.pdf
-
- Deep Recurrent Q-Learning for Partially Observable MDPs - 1507.06527.pdf
-
- dqn.pdf
-
- [1506.00019] A Critical Review of Recurrent Neural Networks for Sequence Learning
-
- Semantic Domain
-
- Collected Papers of Alexander A. Stepanov
-
- facebook/MemNN: Memory Networks implementations
- MemNN - Memory Networks implementations
- keras/addition_rnn.py at master · fchollet/keras
- keras - Deep Learning library for Python. Convnets, recurrent neural networks, and more. Runs on Theano and TensorFlow.
- karpathy/neuraltalk: NeuralTalk is a Python+numpy project for learning Multimodal Recurrent Neural Networks that describe images with sentences.
- neuraltalk - NeuralTalk is a Python+numpy project for learning Multimodal Recurrent Neural Networks that describe images with sentences.
- Combining Sketch and Tone for Pencil Drawing Production
- Combining Sketch and Tone for Pencil Drawing Production
- submodularity.org: Tutorials, References, Activities and Tools for Submodular Optimization
-
- A Functional Approach to Sex: Reproduction in the Créatúr Framework - Springer
-
- IDEALS @ Illinois: Learning-based inductive invariant synthesis
-
- Random forest - Wikipedia, the free encyclopedia
-
- Learning From Data - Online Course (MOOC)
-
- Stanford University CS231n: Convolutional Neural Networks for Visual Recognition
-
- CS231n Convolutional Neural Networks for Visual Recognition
- Course materials and notes for Stanford class CS231n: Convolutional Neural Networks for Visual Recognition.
- Natural Language Processing - Stanford University | Coursera
- Natural Language Processing from Stanford University. In this class, you will learn fundamental algorithms and mathematical models for processing natural language, and how these can be used to solve practical problems. Take free online classes from 120+ top universities and educational organizations. We partner with schools like Stanford, Yale, Princeton, and others to offer courses in dozens of topics, from computer science to teaching and beyond. Whether you are pursuing a passion or looking to advance your career, Coursera provides open, free education for everyone.
- Stanford University CS224d: Deep Learning for Natural Language Processing
-
- Arxiv Sanity Preserver
-
- Reading List « Deep Learning
-
- https://papers.nips.cc/
- Eletronic Proceedings of Neural Information Processing Systems
- iclr2016:main | ICLR
-
- type theory - What is an reflective tower? - Computer Science Stack Exchange
-
- TR194.pdf
-
- impromptu-shift-tr.dvi - TR611.pdf
-
- rlc4.dvi - for-web.pdf
-
- [1112.3833] Dependently Typed Programming based on Automated Theorem Proving
-
- Python, Machine Learning, and Language Wars
- This is the personal website of a data scientist and machine learning enthusiast with a big passion for Python and open source. Born and raised in Germany, now living in East Lansing, Michigan.
- MusicMood
- This is the personal website of a data scientist and machine learning enthusiast with a big passion for Python and open source. Born and raised in Germany, now living in East Lansing, Michigan.
- Kernel tricks and nonlinear dimensionality reduction via RBF kernel PCA
- This is the personal website of a data scientist and machine learning enthusiast with a big passion for Python and open source. Born and raised in Germany, now living in East Lansing, Michigan.
- Predictive modeling, supervised machine learning, and pattern classification
- This is the personal website of a data scientist and machine learning enthusiast with a big passion for Python and open source. Born and raised in Germany, now living in East Lansing, Michigan.
- Dixon's Q test for outlier identification
- This is the personal website of a data scientist and machine learning enthusiast with a big passion for Python and open source. Born and raised in Germany, now living in East Lansing, Michigan.
- About Feature Scaling and Normalization
- This is the personal website of a data scientist and machine learning enthusiast with a big passion for Python and open source. Born and raised in Germany, now living in East Lansing, Michigan.
- rasbt/pattern_classification: A collection of tutorials and examples for solving and understanding machine learning and pattern classification tasks
- pattern_classification - A collection of tutorials and examples for solving and understanding machine learning and pattern classification tasks
- Noncommutative logic - Wikipedia, the free encyclopedia
-
- sane.dvi - unity-duality.pdf
-
- Welcome to LFCS — LFCS
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- dblp: Guy H. Broadfoot
- List of computer science publications by Guy H. Broadfoot.
- The Game of Hex: An Automatic Theorem Proving Approach to Game Programming - AAAI00-029.pdf
-
- Koka - Microsoft Research
- Koka is a function oriented programming language that seperates pure values from side-effecting computations through polymorphic effect inference.
- Daan Leijen - Microsoft Research
-
- Peter Suber, Paradox of Self-Amendment, Table of Contents
-
- Peter Suber, Paradox of Self-Amendment, Section 20
-
- w6726.pdf
-
- Philip Guo - My predictions for the state of the art in programming technology in the year 2030
-
- Philip Guo - What is research?
-
- Philip Guo - Google Tech Talk - CDE: Using System Call Interposition to Automatically Create Portable Software Packages
-
- Philip Guo - Two Examples of HCI Research
-
- Philip Guo - Ph.D. Dissertation Summary
-
- Philip Guo - Why Wrangle Data?
-
- Philip Guo - How effective is your research programming workflow?
-
- Philip Guo - Hacking the Ph.D.: Three Serendipitous Projects
-
- Philip Guo - Doing less risky research is more risky for your career
-
- Philip Guo - Opportunistic Paper Reading
-
- Philip Guo - Deconstructing Research Advising
-
- Philip Guo - Stumbling in the right direction
-
- Philip Guo - An example of command-line bullshittery in computer science research
-
- Philip Guo - Learning programming at scale
-
- Philip Guo - The N=2 Interview about Ph.D.s in Computer Science
-
- Philip Guo - Twelve Tips for Data-Driven Research
-
- Philip Guo - Advice for first-year Ph.D. students
-
- Philip Guo - How to write a good HCI research paper
-
- Philip Guo - Interactive Systems for Learning Programming at Scale
-
- Philip Guo - Student Fizz Buzz
-
- Philip Guo - Why universities should offer a programming interview prep elective course
-
- Philip Guo - What to expect over the next decade and beyond (CS graduation speech)
-
- Philip Guo - On Grades
-
- Philip Guo - Advice for MIT Undergraduates
-
- Philip Guo - MIT classes that I have taken
-
- Philip Guo - The advantages of attending a prestigious name-brand university
-
- Philip Guo - Happiness and Academic High-Achievers
-
- Philip Guo - Which college major should I choose?
-
- Philip Guo - Interested in being an undergraduate research assistant in my lab?
-
- Philip Guo - Deconstructing Luck
-
- Philip Guo - The Tenacity Test
-
- Philip Guo - Ten Stories From My Childhood
-
- Philip Guo - Implicit Privilege
-
- Philip Guo - Material Possessions
-
- Compositional Type Checking for Hindley-Milner Type Systems with Ad-hoc Polymorphism - Tandoori-Compositional-Typeclass.pdf
-
- icfp001-Devriese.pdf
-
- Vladimir Slepnev: Simulating template specialization with value-level polymorphism
-
- Vladimir Slepnev: An example of value-level programming in Java
-
- Vladimir Slepnev: July 2014
-
- Vladimir Slepnev: June 2014
-
- Vladimir Slepnev: May 2014
-
- Vladimir Slepnev: April 2014
-
- Vladimir Slepnev: December 2013
-
- Vladimir Slepnev: November 2013
-
- Vladimir Slepnev: August 2013
-
- Haskell for all: Scrap your type classes
-
- LtU Classic Archives
-
- MLton
-
- http://static.userland.com/sh4/gems/lambda/OlegUSENIX2002.txt
-
- Crossing Refactoring's Rubicon
-
- Making it stick.: 10/19/03 - 10/26/03
-
- Conor McBride's Publications
-
- goguen.pdf
-
- regular.pdf
-
- Ornament.pdf
-
- LitOrn.pdf
-
- https://personal.cis.strath.ac.uk/conor.mcbride/pub/OAAO/LitOrn.lagda
-
- Winging It
-
- ObsCoin.pdf
-
- Ripley.pdf
-
- ott.pdf
-
- ren-sub.pdf
-
- Holes.pdf
-
- Dissect.pdf
-
- indexed-containers.pdf
-
- Microsoft Word - cover_worlds.doc - rn2008001_worlds.pdf
-
- LCS Publication - MIT-LCS-TR-205
-
- Lisa Rein's Tour Of Alan Kay's Etech 2003 Presentation
-
- "Tracking Assets..." lisp in a multilingual assault - Google Groups
- Google Groups allows you to create and participate in online forums and email-based groups with a rich experience for community conversations.
- Fonc Info Page
-
- NYC Clojure Users Group 8/17/2011 - David Nolen, Pattern Matching & Predicate Dispatch on Vimeo
- http://www.meetup.com/Clojure-NYC/ From David, "Pattern matching is a powerful tool for processing data based on type and structure. In this talk I’ll…
- The JOSS Primer - RM5220.pdf
-
- art0001
-
- Mindstorms: Children, Computers, And Powerful Ideas: Seymour A. Papert: 9780465046744: Amazon.com: Books
- Mindstorms: Children, Computers, And Powerful Ideas [Seymour A. Papert] on Amazon.com. *FREE* shipping on qualifying offers. <div><I>Mindstorms</I> has two central themes: that children can learn to use computers in a masterful way and that learning to use computers can change the way they learn everything else. Even outside the classroom
- download
-
- DSpace@MIT: Micro-Planner Reference Manual
-
- META II: A Syntax-Oriented Compiler Writing Language
-
- FLEX - A flexible extendable language. Alan Kay 1968 @mprove
-
- Index of ftp://ftp.cs.kun.nl/pub/Clean/papers/cleanbook/
-
- Clean - Google Groups
- Google Groups allows you to create and participate in online forums and email-based groups with a rich experience for community conversations.
- Type Kata: Local data type : Inside 736-131
-
- Monadic Regions
- Various Haskell implementations of the region calculus, to manage resources such as file handles, database connections, etc.
- Improving the world's most popular functional language: user-defined functions in Exceln
-
- Spreadsheets for Images
-
- Table Editor And Planner, Or: Teapot!
-
- 0404335.pdf
-
- Wadler: Blame and contracts
-
- Toward a Unified Language Model
-
- ewd1209 - EWD1209.PDF
-
- CakeML
-
- lics-Her10-markov.pdf
-
- polpol.pdf
-
- Haskell for all: The category design pattern
-
- Edsger W. Dijkstra - Wikiquote
-
- 如果静态类型的语言比动态类型的语言更加适合大项目,那么是否在一定规模和复杂度以下动态类型的语言更好? - 知乎
-
- delimited-continuations-blues.pdf
-
- Informal minutes of IFIP WG2.8 22nd meeting
-
- Higher Lenses | Homotopy Type Theory
- Lenses are a very powerful and practically useful functional construct. They represent "first class" fields for a data structure. Lenses arose in work on bidirectional programming (for example, in Boomerang), and in Haskell, people have given many different definitions of lenses, but the simplest and easiest to replicate in type theory is probably the one…
- Eilenberg-MacLane Spaces in HoTT | Homotopy Type Theory
- For those of you who have been waiting with bated breath to find out what happened to your favorite characters after the end of Chapter 8 of the HoTT book, there is now a new installment: Eilenberg-MacLane Spaces in Homotopy Type Theory Dan Licata and Eric Finster To appear at LICS 2014; pre-print available here. Agda available here.…
- Homotopy Type Theory should eat itself (but so far, it’s too big to swallow) | Homotopy Type Theory
- The title of this post is an homage to a well-known paper by James Chapman called Type theory should eat itself. I also considered titling the post How I spent my Christmas vacation trying to construct semisimplicial types in a way that I should have known in advance wasn't going to work. As both titles…
- Composition is not what you think it is! Why “nearly invertible” isn’t. | Homotopy Type Theory
- A few months ago, Nicolai Kraus posted an interesting and surprising result: the truncation map |_| : ℕ → ‖ℕ‖ is nearly invertible. This post attempts to explain why "nearly invertible" is a misnomer. I, like many others, was very surprised by Nicolai's result. I doubted the result, tried to push the example through using…
- The surreals contain the plump ordinals | Homotopy Type Theory
- The very last section of the book presents a constructive definition of Conway's surreal numbers as a higher inductive-inductive type. Conway's classical surreals include the ordinal numbers; so it's natural to wonder whether, or in what sense, this may be true constructively. Paul Taylor recently made an observation which leads to an answer. The constructive…
- Another proof that univalence implies function extensionality | Homotopy Type Theory
- The fact, due to Voevodsky, that univalence implies function extensionality, has always been a bit mysterious to me---the proofs that I have seen have all seemed a bit non-obvious, and I have trouble re-inventing or explaining them. Moreover, there are questions about how it fits into a general conception of type theory: Why does adding an…
- New writeup of πn(Sn) | Homotopy Type Theory
- I'm giving a talk this week at CPP. While I'm going to talk more broadly about applications of higher inductive types, for the proceedings, Guillaume Brunerie and I put together an "informalization" of πn(Sn), which you can find here. This is a different proof of πn(Sn) than the one in the HoTT book---this is the first…
- The Truncation Map |_| : ℕ -> ‖ℕ‖ is nearly Invertible | Homotopy Type Theory
- Magic tricks are often entertaining, sometimes boring, and in some rarer cases astonishing. For me, the following trick belongs to the third type: the magician asks a volunteer in the audience to think of a natural number. The volunteer secretly chooses a number n. As a proof that he has really chosen a number, he…
- Gilad Bracha’s Home Page
-
- Nickle
-
- Elephant 2000: A Programming Language Based on Speech Acts
- Elephant 2000: A Programming Language Based on Speech Acts
- Concurrent Haskell - Wikipedia, the free encyclopedia
-
- Rdgs-NW-Bledsoe.pdf
-
- Machine Learning for ACL2
-
- Machine-Learning automated Proofs
-
- LNCS 8689 - Visualizing and Understanding Convolutional Networks - zeilerECCV2014.pdf
-
- ezyang's research log — The Essence of Reynolds
- The Essence of Reynolds “a big number-crunching program to compute an uninteresting number in a bad quantity” Try to look for the right question, the most general way to pose a problem. Getting the...
- Generic Haskell - Welcome
- Generic Haskell Your strategic business partner working with you for your success, providing you qualified, knowledgeable and experienced professionals, Business Intelligence (BI) solutions
- Full and faithful functors - Wikipedia, the free encyclopedia
-
- 东方夜华录-首页 ~Sierra's Touhou Melody
- 东方夜华录软件主页,一款面向东方Project爱好者的同人音乐分享软件,致力于打造成一个东方同人音乐分享交流平台。
- 認知偏誤列表 - 维基百科,自由的百科全书
-
- 166个心理学现象效应
-
- rows.pdf
-
- Row Polymorphism Isn't Subtyping - BAM Weblog
-
- rows.pdf
-
- 像外行一样思考,像专家一样实践(修订版) (豆瓣)
- 图书像外行一样思考,像专家一样实践(修订版) 介绍、书评、论坛及推荐
- shannon38.pdf - shannon38.pdf
-
- Category Theory for Programmers: The Preface | Bartosz Milewski's Programming Cafe
- Table of Contents Part One Category: The Essence of Composition Types and Functions Categories Great and Small Kleisli Categories Products and Coproducts Simple Algebraic Data Types Functors Functoriality Function Types Natural Transformations Part Two Declarative Programming Limits and Colimits Free Monoids Representable Functors The Yoneda Lemma Yoneda Embedding Part Three It's All About Morphisms Adjunctions…
- Learning Haskell the Hard Way | SuperGinBaby
- So...Haskell Programming is out for early access now. And since I am on record as being a Haskell noob, sometimes people wonder how I am managing to (co-)write a book for teaching Haskell. I've already told my story about how I came to start learning Haskell and how I knew absolutely nothing about programming previously. It's hard…
- Haskell Programming - Progress
- An exercise-driven Haskell book for beginners that works for non-programmers and experienced hackers alike.
- CiteSeerX — Citation Query A Brief History of Natural Deduction. History and Philosophy of Logic 20:1–31
- CiteSeerX - Scientific documents that cite the following paper: A Brief History of Natural Deduction. History and Philosophy of Logic 20:1–31
- panda a proof assistant in natural deduction for all. a gentzen style proof assistant for undergraduate students - 学士论文 - 道客巴巴
- pandaaproofassistantinnaturaldeductionforall.agentzenstyleproofassistantforundergraduatestudents
- download
-
- http://donsbot.files.wordpress.com/2009/01/semicolon.pdf
-
- Doron Zeilberger's 65th Opinion
-
- No Title
-
- A Behavioral Notion of Subtyping
-
- Advogato: Blog for graydon
-
- Subtyping, Subclassing, and Trouble with OOP
- Example of how an implementation inheritance prevents separation of interface and implementation
- Why I am developing Amber - Amber
- Why I Am Developing Amber Jun 16th, 2012 programmer> I've finished writing the program. programmer> Compile it to C code and evaluate performance. …
- CiteSeerX — Amber
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Introduction The Amber language embeds many recent ideas in programming language design, and tries to introduce all the features in their minimal, essential, form. One of its main goals is to safely blend static typing with the dynamic requirements of a system programming language. For this purpose, multiple inheritance and persistent objects are integrated in a strongly typed language. Other features include graphics, higher-order functions, modules and concurrency. Amber is a spin-off of the ML programming language [Milner 84]. The ML language is now being standardized, and as such is not very suitable for experimentation. Amber is intended as a tool for trying out new ideas in language implementation, language design, and language environments, while being deeply influenced by the ML experience. As a programming language, Amber was defined to experiment with a new style of polymorphism [Cardelli 84b] which, unlike the ML-style parametric polymorphism [Milner 78], is based o
- The Programming Language Amber - Amber
- The Programming Language Amber Jun 7th, 2015 What is Amber? Caution: This documents don’t follow the latest laguage specification Amber is an …
- This Week in D: March 20, 2016
-
- First-order Logic is a Modal Logic
-
- ab.pdf
-
- http://i.imgur.com/PgZtz0j.gif
-
- tldi09.pdf
-
- Research papers/Parallelism and concurrency - HaskellWiki
-
- https://www.coursera.org/learn/learning-how-to-learn
- Take free online classes from 120+ top universities and educational organizations. We partner with schools like Stanford, Yale, Princeton, and others to offer courses in dozens of topics, from computer science to teaching and beyond. Whether you are pursuing a passion or looking to advance your career, Coursera provides open, free education for everyone.
- A Mind for Numbers: How to Excel at Math and Science (Even If You Flunked Algebra): Barbara Oakley: 9780399165245: Amazon.com: Books
- A Mind for Numbers: How to Excel at Math and Science (Even If You Flunked Algebra) [Barbara Oakley] on Amazon.com. *FREE* shipping on qualifying offers. <b>The companion book to COURSERA®'s wildly popular massive open online course Learning How to Learn </b> Whether you are a student struggling to fulfill a math or science requirement
- Use Your Perfect Memory: Dramatic New Techniques for Improving Your Memory; Third Edition (Plume): Tony Buzan: 9780452266063: Amazon.com: Books
- Use Your Perfect Memory: Dramatic New Techniques for Improving Your Memory; Third Edition (Plume) [Tony Buzan] on Amazon.com. *FREE* shipping on qualifying offers. Now in a totally updated edition--the secrets of how to stretch memory skills to the fullest. Buzan has devised an ingenious system for memory improvement
- Moonwalking with Einstein: The Art and Science of Remembering Everything: Joshua Foer: 9780143120537: Amazon.com: Books
- Moonwalking with Einstein: The Art and Science of Remembering Everything [Joshua Foer] on Amazon.com. *FREE* shipping on qualifying offers. <b>The blockbuster phenomenon that charts an amazing journey of the mind while revolutionizing our concept of memory</b> An instant bestseller that is poised to become a classic
- Embracing the Wide Sky: A Tour Across the Horizons of the Mind: Daniel Tammet: 9781416576181: Amazon.com: Books
- Embracing the Wide Sky: A Tour Across the Horizons of the Mind [Daniel Tammet] on Amazon.com. *FREE* shipping on qualifying offers. Owner of the most remarkable mind on the planet, (according to Entertainment Weekly</i>) Daniel Tammet captivated readers and won worldwide critical acclaim with the 2007 New York Times</i> bestselling memoir
- Cascading Coffee
-
- Princess Kingdom
-
- An Introduction to Redex with Abstracting Abstract Machines (v0.5)
-
- Lucid (programming language) - Wikipedia, the free encyclopedia
-
- DSP specification using the Silage language
- DSP specification using the Silage language on ResearchGate, the professional network for scientists.
- Read Read-Eval-Print-λove | Leanpub
-
- Read-Eval-Print-λove by Michael Fogus [Leanpub PDF/iPad/Kindle]
- A primordial Forth, and some related philosophy.
- Fexpr the Ultimate Lambda
- Exploring the design and implementation of reliable, scalable, massively-concurrent computer systems
- Lisps, First-Class Special Forms, Fexprs, The Kernel Programming Language | Lambda the Ultimate
-
- Structural insight: Fexpr
-
- The Axis of Eval: Why fexprs, part N, or lambda only the penultimate
-
- LEARNING LISP - FEXPRS: Unevaluating Functions
-
- Runtime Macro
-
- The Early History of Smalltalk
-
- Fexprs remain inscrutable (eighty-twenty news)
-
- ``Special Forms in Lisp'' by Kent Pitman (August, 1980)
-
- ICMS 2016
-
- ICMS 2016
-
- CS 701 (Section 1, Fall 2015)
-
- Frege–Church ontology - Wikipedia, the free encyclopedia
-
- Cliff Click 说他再也不要在 callee-saved registers 里存 oop 了 - 方泽图的文章 - 知乎专栏
- 知乎专栏
- palmskog/fitch: Certified proof checker for Fitch-style propositional logic proofs
- fitch - Certified proof checker for Fitch-style propositional logic proofs
- [1007.2885] Multi-Level Languages are Generalized Arrows
-
- zseq.pdf
-
- Fate/sn×銀英伝クロスを考えてみた - ハーメルン
-
- Generating Mazes with Inductive Graphs | jelv.is
-
- F-algebra - Wikipedia, the free encyclopedia
-
- F-coalgebra - Wikipedia, the free encyclopedia
-
- mathclasses-diamond.pdf
-
- A Constructive Algebraic Hierarchy in Coq - 1-s2.0-S0747717102905523-main.pdf
-
- Programming with effects I: Theory | Mathematics and Computation
-
- cont-tcs.pdf
-
- notes.dvi - ssgp06.pdf
-
- Approximating Inductive Types in Coq | Gregory Malecha
- I do research on programming languages, program verification, compilers, and program analysis.
- Modules for Modalities | Homotopy Type Theory
- As defined in chapter 7 of the book, a modality is an operation on types that behaves somewhat like the n-truncation. Specifically, it consists of a collection of types, called the modal ones, together with a way to turn any type $latex A$ into a modal one $latex \bigcirc A$, with a universal property making…
- Running Circles Around (In) Your Proof Assistant; or, Quotients that Compute | Homotopy Type Theory
- Higher-dimensional inductive types are an idea that many people have been kicking around lately; for example, in An Interval Type Implies Function Extensionality. The basic idea is that you define a type by specifying both what it's elements are (as usual), and what the paths/equivalences between them are, and what the paths between paths are,…
- CMU-CS-93-151.pdf
-
- fixpoints.pdf
-
- On Greatest Fixpoint Semantics of Logic Programming
-
- Machine Learning Books Suggested by Michael I. Jordan from Berkeley | StatsBlogs.com | All About Statistics
-
- lukethesis.pdf
-
- Higher Inductive Types: a tour of the menagerie | Homotopy Type Theory
- (This was written in inadvertent parallel with Mike’s latest post at the Café, so there’s a little overlap — Mike’s discusses the homotopy-theoretic aspects more, this post the type-theoretic nitty-gritty.) Higher inductive types have been mentioned now in several other posts, so it’s probably time to bring the full troupe out into the sunshine and…
- MTC.pdf
-
- 1509.03021.pdf
-
- Church encoding of identity types, courtesy of Ben Delaware
-
- The Nax Language: Unifying Functional Programming and Logical Reasoning in a Language based on Mendler-style Recursion Schemes and Term-indexed Types - viewcontent.cgi
-
- kya_seminar.pdf
-
- nwpt98-njc.pdf
-
- Flip your NSF Rejection | taliasplse
- I spent the last few days of March in 2015 refreshing TheGradCafe and my email inbox. I get push notifications for my email, so I'm not sure why I bothered refreshing it. I guess I was hoping it'd make things go faster. It didn't. One night, FastLane went down for maintenance. Posters on TheGradCafe noted…
- taliasplse
-
- lo.logic - Categorical foundations without set theory - MathOverflow
-
- fdpefinalweb.dvi - fdp.pdf
-
- Tech talk: Toward Extracting Monadic Programs from Proofs - Galois, Inc.
-
- Simple architecture for mixins for all Smalltalk dialects - Google Groups
- Google Groups allows you to create and participate in online forums and email-based groups with a rich experience for community conversations.
- SCG: Traits - Composable Units of Behavior
-
- The Nice programming language
-
Nice is an advanced programming language that extends Java with
parametric types, functional programming and more!
- Needle, An Object-Oriented Functional Language
-
- Moby home page
-
- Scha03aTraits.pdf
-
- thesis.pdf
-
- Obliq - Wikipedia, the free encyclopedia
-
- ATP工具书 - Continuation - 知乎专栏
- 知乎专栏
- Dialectica interpretation - Wikipedia, the free encyclopedia
-
- How to Prove It: A Structured Approach, 2nd Edition: Daniel J. Velleman: 9780521675994: Amazon.com: Books
- Buy How to Prove It: A Structured Approach, 2nd Edition on Amazon.com ✓ FREE SHIPPING on qualified orders
- Dynasty Reader » Like a Star ch01
- Online manga reader for scanlations released by Dynasty Scans and other Yuri groups.
- Dynasty Reader » Love-Coloured Code
- Online manga reader for scanlations released by Dynasty Scans and other Yuri groups.
- DRAKON-Erlang part 6
-
- Function block diagram - Wikipedia, the free encyclopedia
-
- Learnable Programming
-
- DRAKON-Erlang part 1
-
- Workflow - Wikipedia, the free encyclopedia
-
- drakon_fbd.png (PNG Image, 664 × 384 pixels)
-
- fbd_in_icon.png (PNG Image, 636 × 467 pixels)
-
- DSLs:<br>A Logical Approach (EECE 571F= Domain-Specific Languages)
-
- Project Web -- Status
-
- Algorithms for Dynamic Memory Management (236780)
-
- Goals and method | Vipassana course @ Sapienza
- All living beings are conditioned. Already a unicellular organism reacts differently to nearby nutrition or poison: in the first case there is approaching, in the second case avoiding. This primitive form of desire and aversion enhances the survival chances of the organism. But sometimes, notably after environmental changes, an organism may be over-conditioned. Insects orient…
- Pure Type Systems in Rewriting Logic
-
- "TinkerType: A Language for Playing With Formal Systems" by Michael Y. Levin and Benjamin C. Pierce
- TinkerType is a pragmatic framework for compact and modular description of formal systems (type systems, operational semantics, logics, etc.). A family of related systems is broken down into a set of clauses — individual inference rules — and a set of features controlling the inclusion of clauses in particular systems. Simple static checks are used to help maintain consistency of the generated systems.
We present TinkerType and its implementation, and describe its application to two substantial repositories of typed λ-calculi. The first repository covers a broad range of typing features, including subtyping, polymorphism, type operators and kinding, computational effects, and dependent types. It describes both declarative and algorithmic aspects of the systems, and can be used with our tool, the TinkerType Assembler, to generate calculi either in the form of typeset collections of inference rules or as executable ML typecheckers. The second repository addresses a smaller collection of systems, and provides modularized proofs of basic safety properties.
- Tinkertype
-
- Gödel, Nagel, minds and machines | Lambda the Ultimate
-
- Gödel-Nagel final.pdf - godelnagel.pdf
-
- Löwenheim–Skolem theorem - Wikipedia, the free encyclopedia
-
- ecoop14-tsls.pdf
-
- Pd Documentation 2
-
- SRFI 108: Named quasi-literal constructors
-
- Shell-style programming in Kawa
-
- Is it a binary file? Is it a text file? It's a Blob
-
- () - Programming Discrete Distributions with Chemical Reaction Networks (arxiv).pdf
-
- Efficient Syntax-Driven Lumping of Differential Equations.pdf
-
- Symbolic Computation of Differential Equivalences - Symbolic Computation of Differential Equivalences.pdf
-
- Stochastic Analysis of Chemical Reaction Networks Using Linear Noise Approximation.pdf
-
- Forward and Backward Bisimulations for Chemical Reaction Networks.pdf
-
- Microsoft Word - CRN Morphisms v7.docx - CRN Morphisms (BMC).pdf
-
- From Processes to ODEs by Chemistry - On Process Rate Semantics.pdf
-
- From Processes to ODEs by Chemistry - Process Algebra Master Equation.pdf
-
- Microsoft Word - From Processes to ODEs by Chemistry.docx - From Processes to ODEs by Chemistry.pdf
-
- A Correct Abstract Machine for the Stochastic Pi-calculus (TCSB).pdf
-
- Efficient Simulation of Biological Processes in Stochastic Pi Calculus (CMSB).pdf
-
- A Graphical Representation for Stochastic Pi-calculus (TCSB).pdf
-
- Re: CPP and system configuration
-
- fpca.dvi - lenient.pdf
-
- Monadic combinators for scoped resource management - Google Groups
- Google Groups allows you to create and participate in online forums and email-based groups with a rich experience for community conversations.
- Fearing what might be true | Armed and Dangerous
-
- Fallacies of distributed computing - Wikipedia, the free encyclopedia
-
- Wiki: ETL
-
- Cincom Smalltalk Blogs
- Home > Community > Cincom Smalltalk Blogs Cincom Blogs Arden Thomas - ArdenCST (Feed) Cincom Smalltalk Tech Tips Blog - CST Tech
- Interleaving stream processors : Inside 736-131
-
- On expressivity : Inside 736-131
-
- You are in a maze of twisty little passages, all alike… (a GHC hacking post) : Inside 736-131
-
- OCaml for Haskellers : Inside 736-131
-
- Purpose of proof: semi-formal methods : Inside 736-131
-
- A radical Hackage social experiment : Inside 736-131
-
- Graphs not grids: How caches are corrupting young algorithms designers and how to fix it : Inside 736-131
-
- MVC and Purity : Inside 736-131
-
- The secret to successful autogenerated docs : Inside 736-131
-
- Static Analysis for everyday (not-PhD) man : Inside 736-131
-
- Design Patterns in Haskell : Inside 736-131
-
- Art. Code. Math. (And mit-scheme) : Inside 736-131
-
- Creative catamorphisms : Inside 736-131
-
- Freer Monads and Extensible Effects
- Framework for modular combination of effects based on Cartwright and Felleisen's idea of effects as interaction, augmented with types and effect encapsulation
- exteff.pdf
-
- tr-15-04.pdf
-
- iwil15.pdf
-
- lean_description.pdf
-
- jacm11-biabduction-webversion.pdf
-
- Contents • Build Your Own Lisp
-
- Model Checking Publications
-
- I am not a number, I am a classy hack « Epilogue
-
- Epilogue
-
- names-for-free.pdf
-
- auto.dvi - icfp09.pdf
-
- programming-as-experience.pdf
-
- Why Pascal is Not My Favorite Programming Language
-
- indexed functor - Google Search
-
- Home Page of Professor Michael Franz, University of California, Irvine
- Home Page of Professor Michael Franz, University of California, Irvine
- PLLC.pdf
-
- cspbook.pdf
-
- Occam Manual3 - occam.pdf
-
- The Comonad.Reader » Mirrored Lenses
-
- Lenses from Scratch - School of Haskell | School of Haskell
-
- DSL | Lambda the Ultimate
-
- Semantics | Lambda the Ultimate
-
- Category Theory | Lambda the Ultimate
-
- Lambda Calculus | Lambda the Ultimate
-
- Theory | Lambda the Ultimate
-
- Teaching & Learning | Lambda the Ultimate
-
- Scientific Programming | Lambda the Ultimate
-
- Software Engineering | Lambda the Ultimate
-
- Meta-Programming | Lambda the Ultimate
-
- OOP | Lambda the Ultimate
-
- Logic/Declarative | Lambda the Ultimate
-
- Object-Functional | Lambda the Ultimate
-
- Functional | Lambda the Ultimate
-
- Paradigms | Lambda the Ultimate
-
- Misc Books | Lambda the Ultimate
-
- Fun | Lambda the Ultimate
-
- General | Lambda the Ultimate
-
- A List of Successes That Can Change the World - Springer
-
- wadler-1985.pdf
-
- applicativedo.pdf
-
- ghc-shake.pdf
-
- Learning long-term dependencies with gradient descent is difficult - Neural Networks, IEEE Transactions on - tnn-94-gradient.pdf
-
- Neural Networks, Types, and Functional Programming -- colah's blog
-
- Towards a categorical semantics of type classes
-
- 抽象解释误区 - Continuation - 知乎专栏
- 知乎专栏
- Philip Guo - What is a programming language? A six-layer model
-
- Philip Guo - Passive Pair Programming
-
- Philip Guo - Programming in a Vacuum
-
- Philip Guo - Interactive Systems for Learning Programming at Scale
-
- Philip Guo - What is a programming language? (45-minute lecture)
-
- Philip Guo - My CS Education Zoo interview
-
- Philip Guo - Computer Science in Modern Everyday Life
-
- Philip Guo - Introductory Computer Programming Education
-
- Philip Guo - The Two Cultures of Computing
-
- Philip Guo - Code Carabiners
-
- Philip Guo - Silent Technical Privilege
-
- p115-gabriel.pdf
-
- p-value - Wikipedia, the free encyclopedia
-
- more.pdf
-
- garrigue-polymorphic_variants-ml98.pdf
-
- A Neighborhood of Infinity: The Monads Hidden Behind Every Zipper
-
- Strongtalk: A High-Performance Open Source Smalltalk With An Optional Type System
-
- A Concurrency System for Idris and Erlang - Elliott_BSc_Dissertation.pdf
-
- The Psychology of Problem Solving (豆瓣)
- 图书The Psychology of Problem Solving 介绍、书评、论坛及推荐
- syl20bnr/spacemacs - Gitter
-
- Tillers on Evidence and Inference: AI
-
- Tillers on Evidence and Inference: AI and Evidence
-
- Tillers on Evidence and Inference: AI and Evidential Inference
-
- Tillers on Evidence and Inference: AI and Factual Inference
-
- Tillers on Evidence and Inference: complexity and imprecision
-
- Tillers on Evidence and Inference: intuition and explicit reasoning
-
- Tillers on Evidence and Inference: Internet and Privacy
-
- Tillers on Evidence and Inference: Internet and Anonymity
-
- Tillers on Evidence and Inference: intelligence amplification
-
- Tillers on Evidence and Inference: representations and intelligence
-
- The Grok Homepage
-
- Apache OpenNLP - Welcome to Apache OpenNLP
- Apache OpenNLP is a Java machine learning toolkit for natural language processing (NLP).
It supports the most common NLP tasks.
- CSLI LinGO Lab
- This page provides information about
the CSLI Linguistic Grammars Online (LinGO) Lab at Stanford
University.
- Package: lang/prolog/code/parsing/ale/
-
- LtU Classic Archives
-
- Lambda the Ultimate logic/declarative
-
- Lambda the Ultimate functional
-
- Lambda the Ultimate general
-
- Lambda the Ultimate theory
-
- The danger of benchmarks — The Adventures of a Pythonista in Schemeland v0.1 documentation
-
- Quoting and quasi-quoting — The Adventures of a Pythonista in Schemeland v0.1 documentation
-
- Introduction to (sweet-)macros — The Adventures of a Pythonista in Schemeland v0.1 documentation
-
- Features of (sweet-)macros — The Adventures of a Pythonista in Schemeland v0.1 documentation
-
- The multiple evaluation problem (and easy-test) — The Adventures of a Pythonista in Schemeland v0.1 documentation
-
- Breaking hygiene — The Adventures of a Pythonista in Schemeland v0.1 documentation
-
- Comparing identifiers — The Adventures of a Pythonista in Schemeland v0.1 documentation
-
- Hygienic macros — The Adventures of a Pythonista in Schemeland v0.1 documentation
-
- except.pdf
-
- Coeffects: Context-aware programming languages
- Interactive essay that explains theory of coeffects and lets you type-check and run sample programs.
- Prettt-tty, pretty, pretty good!: Programmatic translation to iteratees from pull-based code
-
- E.C.R.Hehner
-
- Programming with Narrowing: a Tutorial - paper.pdf
-
- Curry (programming language) - Wikipedia, the free encyclopedia
-
- GaTech SqueakEnd 2002
-
- Schedule
-
- Io (programming language) - Wikipedia, the free encyclopedia
-
- io language
-
- Multiparadigm Programming in Leda
-
- Macro systems | Lambda the Ultimate
-
- 641.pdf
-
- Not Even Wrong
-
- Shtetl-Optimized
-
- January | 2016 | Generic Language
- 1 post published by Ted Kaminski during January 2016
- June | 2015 | Generic Language
- 2 posts published by Ted Kaminski during June 2015
- February | 2015 | Generic Language
- 1 post published by Ted Kaminski during February 2015
- January | 2015 | Generic Language
- 3 posts published by Ted Kaminski during January 2015
- December | 2014 | Generic Language
- 1 post published by Ted Kaminski during December 2014
- March | 2014 | Generic Language
- 1 post published by Ted Kaminski during March 2014
- August | 2013 | Generic Language
- 1 post published by Ted Kaminski during August 2013
- July | 2013 | Generic Language
- 1 post published by Ted Kaminski during July 2013
- November | 2012 | Generic Language
- 2 posts published by Ted Kaminski during November 2012
- September | 2012 | Generic Language
- 1 post published by Ted Kaminski during September 2012
- November | 2011 | Generic Language
- 1 post published by Ted Kaminski during November 2011
- October | 2011 | Generic Language
- 1 post published by Ted Kaminski during October 2011
- September | 2011 | Generic Language
- 1 post published by Ted Kaminski during September 2011
- August | 2011 | Generic Language
- 1 post published by Ted Kaminski during August 2011
- April | 2011 | Generic Language
- 2 posts published by Ted Kaminski during April 2011
- February | 2011 | Generic Language
- 1 post published by Ted Kaminski during February 2011
- December | 2010 | Generic Language
- 1 post published by Ted Kaminski during December 2010
- November | 2010 | Generic Language
- 2 posts published by Ted Kaminski during November 2010
- October | 2010 | Generic Language
- 1 post published by Ted Kaminski during October 2010
- September | 2010 | Generic Language
- 3 posts published by Ted Kaminski during September 2010
- August | 2010 | Generic Language
- 7 posts published by Ted Kaminski during August 2010
- Why KRL?
-
- Wiki Design Principles
-
- Computer-supported cooperative work - Wikipedia, the free encyclopedia
-
- Ambient intelligence - Wikipedia, the free encyclopedia
-
- Ubiquitous computing - Wikipedia, the free encyclopedia
-
- Unix as programming language | Lambda the Ultimate
-
- Exploration of Program as Language | Lambda the Ultimate
-
- (Homotopy) Type Theory: Chapter One : Inside 736-131
-
- HoTT exercises in Coq (in progress) : Inside 736-131
-
- Equality, roughly speaking : Inside 736-131
-
- Diagrammatic Representations in Domain-Specific Languages
-
- Google Groups
- Google Groups allows you to create and participate in online forums and email-based groups with a rich experience for community conversations.
- Conception, evolution, and application of functional programming languages
-
- Deep Learning, NLP, and Representations - colah's blog
-
- Neural Networks, Manifolds, and Topology -- colah's blog
-
- Calculus on Computational Graphs: Backpropagation -- colah's blog
-
- Visualizing MNIST: An Exploration of Dimensionality Reduction - colah's blog
-
- Visualizing Representations: Deep Learning and Human Beings - colah's blog
-
- Research Blog: Inceptionism: Going Deeper into Neural Networks
-
- Groups & Group Convolutions - colah's blog
-
- Understanding Convolutions - colah's blog
-
- Conv Nets: A Modular Perspective - colah's blog
-
- Fanfiction, Graphs, and PageRank - colah's blog
-
- Data.List Recursion Illustrated - colah's blog
-
- Visual Information Theory -- colah's blog
-
- Optimizing synthesis with metasketches
-
- Type-directed completion of partial expressions
-
- High-level small-step operational semantics for transactions
-
- icse_outline.dvi - matching_icse07.pdf
-
- Preventing format-string attacks via automatic and efficient dynamic checking
-
- Computers, Chess and Long-Range Planning | Michail M. Botvinnik | Springer
- Mihail Moiseevich Botvinnik is an electrical engineer by profession; during World War II he headed a high-tension laboratory in the Urals and was
- Alex Payne — An Unfinished Idea: A Conference On Emerging Programming Languages
- The online writing of Alex Payne
- Alex Payne — An Unfinished Idea: A Book On The History of Programming Languages
- The online writing of Alex Payne
- Alex Payne — Instinct and Intuition
- The online writing of Alex Payne
- Alex Payne — On Problem Solving
- The online writing of Alex Payne
- lfp88.pdf
-
- Phys. Rev. Lett. 116, 128701 (2016) - Schr\"odinger Approach to Mean Field Games
- Models that treat economic and biological behavior in terms of game-play resemble quantum mechanics.
- Brian Cantwell Smith: On the Origins of Objects
- Brian Cantwell Smith's research on the Foundations of Computation and his contribution to a scientific Ontology
- Greg Morrisett
-
- FloydMeaning.pdf
-
- proof of algorithm by general snapsbots - Google Search
-
- 尼克:王浩和他的朋友们
-
- Mathematical Logic (Graduate Texts in Mathematics): J.D. Monk: 9780387901701: Amazon.com: Books
- Buy Mathematical Logic (Graduate Texts in Mathematics) on Amazon.com ✓ FREE SHIPPING on qualified orders
- Naive Computational Type Theory, by Robert L. Constable
-
- Academic Home Page for Amr Sabry
-
- What Do You Care What Other People Think - Google Search
-
- frege-writings.pdf
-
- Jones, Gomard, Sestoft: Partial Evaluation
-
- NU-CCIS-14-01.pdf
-
- icfp2002-ff.pdf
-
- paper.dl.dvi - oopsla01-ff.pdf
-
- paper.dvi - fse01-flf.pdf
-
- oopsla13-dff.pdf
-
- scheme2006-cf.pdf
-
- main.dvi - popl06-mff.pdf
-
- f174-cobbe.dvi - popl05-cf.pdf
-
- Full Stack Lisp by Pavel Penev [Leanpub PDF/iPad/Kindle]
- Learn how to build and deploy modern Lisp applications in the booming ecosystem of modern software!
- The fate of IEEE Scheme - Google Groups
- Google Groups allows you to create and participate in online forums and email-based groups with a rich experience for community conversations.
- tr97-293.dvi - tr97-293.pdf
-
- tr182-f.pdf
-
- The Design of Design: Essays from a Computer Scientist: Frederick P. Brooks Jr.: 0785342362985: Amazon.com: Books
- The Design of Design: Essays from a Computer Scientist [Frederick P. Brooks Jr.] on Amazon.com. *FREE* shipping on qualifying offers. <B>Making Sense of Design</B> <P>Effective design is at the heart of everything from software development to engineering to architecture. But what do we really know about the design process? What leads to effective
- Proof-theoretic Approach to Craig Interpolation - slides_kuznets.pdf
-
- Admissible numbering - Wikipedia, the free encyclopedia
-
- Process Algebra Diary: Ode to the Automata Tutor
-
- Process Algebra Diary
-
- Transforming matings into natural deduction proofs - Springer
-
- 1986 - An Integration of Resolution and Natural Deduction Theorem Proving - aaai86.pdf
-
- tps94-report-94-166a.pdf
-
- Proof Explanation and Revision - viewcontent.cgi
-
- Looking inside machine learning black boxes - Julia Evans
-
Looking inside machine learning black boxes
I do machine learnin...
- Elided Branches
- Technology, startups, programming, technical management and software architecture
- Tips To Increase Your Conference Talk Acceptance Rate
-
- The Universe of Discourse : A message to the aliens (introduction)
-
- Abstractivate: Ultratestable Coding Style
-
- 7 John McCarthy Papers in 7 weeks – #1 How My Thermostat has Beliefs and Goals - Squid's Blog
- Ascribing Mental Qualities to Machines or How My Thermostat has Beliefs and Goals After reading John McCarthy’s paper this week Ascribing …
- Squid's Blog
- Published on: Mar 16th, 2016 Tags: All, Clojure It happened again. I was sitting down reading a paper and I came across the phrase Kolmogorov- …
- mathbabe | Exploring and venting about quantitative issues
- Exploring and venting about quantitative issues
- Accidentally Quadratic
-
- Julia Evans
-
Hey! I'm Julia. Welcome to my blog. Here's every post I've ever written. If you want somewhere to start, try my favorites (the ones with s...
- Francisco Sant’Anna: Dynamic Organisms in Céu on Vimeo
- We propose a new abstraction mechanism for a synchronous reactive programming language: Organisms reconcile objects and threads into a single concept. We enforce…
- Jonathan Edwards: Two-way Dataflow on Vimeo
- Subtext is an experiment to radically simplify application programming. The goal is to combine the power of frameworks like Rails and iOS with the simplicity of…
- The Synergy between Programming Languages and Cryptography - The PL Enthusiast
- Summary of Dagstuhl Seminar on finding the Synergy between Programming Languages and Cryptography
- What is probabilistic programming? - The PL Enthusiast
- We examine the growing menagerie of probabilistic programming languages, and how they aim to democratize machine learning.
- Simple Made Easy
- Rich Hickey emphasizes simplicity’s virtues over easiness’, showing that while many choose easiness they may end up with complexity, and the better way is to choose easiness along the simplicity path.
- [1010.5023] Yacc is dead
-
- David Darais
-
- research!rsc: Yacc is Not Dead
-
- Backus-CanProgrammingBeLiberated.pdf
-
- Solving the Prisoners’ Dilemma
-
- Advanced Programming Language Design: 0000805311912: Computer Science Books @ Amazon.com
- Advanced Programming Language Design: 0000805311912: Computer Science Books @ Amazon.com
- Advanced_programming_language_design.pdf
-
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Lambda Days 2016
- <p>Functional programming is taking Kraków by storm. Scala, Erlang, Haskell, Elixir, Lisp and Clojure are scoring points with IT professionals, computer science students and technology geeks.</p>
- Cognitive Dimensions of Notations Resource Site
-
- Statecharts in the making: a personal account - Statecharts.History.pdf
-
- c01.indd - 0471798142.pdf
-
- New Report Questions the Use of Mathematics as a Foundation for Computer Science
- New Report Questions the Use of Mathematics as a Foundation for Computer Science, Finansnyheder på Euroinvestor giver dig hurtigt overblik for aktuelle begivenheder om børs og finans
- Bigraphical Programming Languages (BPL) - PLSwiki
-
- ConCert Project: Index Page
- ConCert Project Home Page
- My favorite Archer moment - GIF on Imgur
- Images uploaded by rightarms
- The Self Handbook — Self Handbook for Self 4.5.0 documentation
-
- History of type theory - Wikipedia, the free encyclopedia
-
- Emil Leon Post - Wikipedia, the free encyclopedia
-
- Axiom of reducibility - Wikipedia, the free encyclopedia
-
- Type theory - Wikipedia, the free encyclopedia
-
- Creating a language using only assembly language // Speaker Deck
-
- FOB.dvi - vBdL-ICTCS05.pdf
-
- Crisis? What Crisis? - Wikipedia, the free encyclopedia
-
- Whiley: an Open Source Programming Language with Extended Static Checking
- Whiley is an open source programming language which runs on the JVM and uses extended static checking to eliminate errors at compile time.
- William Cook's Fusings
-
- A Graceful Blog | News about the Grace Programming Language Project
-
- Whiley | Minimising Recursive Data Types
- Minimising recursive types is an interesting problem as, in a structural type system, numerous equivalent but non-identical types are possible.
- Whiley | Implementing Structural Types (with code)
- Over the last few months, I've been working on the type system underpinning Whiley. A key feature is the use of structural typing, rather than nominal typing.
- Whiley | Simplification vs Minimisation of Types in Whiley
- Recently, I've been hardening up the implementation of Whiley's type system. The reason for this is that there are numerous bugs in its code!
- sysF
-
- William Cook's Fusings
-
- Blog - Quils in Space
- Extending Fold and Unfold to Exponential Embarassing-ness
- asr-oopsla13.pdf
-
- New album by Team Shanghai Alice : 燕石博物誌 ~ Dr.Latency's Freak Report : touhou
- reddit: the front page of the internet
- CoqHoTT
- Homepage of the CoqHoTT project
- Om
- The Om programming language.
- Rectifier (neural networks) - Wikipedia, the free encyclopedia
-
- GAP System for Computational Discrete Algebra
- GAP system for computational discrete algebra, especially computational group theory
- Moldbuggery
-
- Dynasty Reader » Amaranth
- Online manga reader for scanlations released by Dynasty Scans and other Yuri groups.
- 1603.07259.pdf
-
- Galileo.A4.pdf
-
- http://dl.acm.org/citation.cfm?id=1096.1099
-
- Viewing object-oriented programming as an enhancement of data abstraction methodology in SearchWorks
- Stanford University Libraries' official online search tool for books, media, journals, databases, government documents and more.
- 15-424: Foundations of Cyber-Physical Systems -- Schedule
- Cyber-physical systems (CPSs) combine cyber effects (computation and/or communication) with physical effects (motion or other physical processes). Designing algorithms to control CPSs, such as those in cars, aircraft and robots, is challenging due to their tight coupling with physical behavior. At the same time, it is vital that these algorithms be correct, since we rely on CPSs for safety-critical tasks like keeping aircraft from colliding. Students in this course will understand the core principles behind CPSs, develop models and controls, identify safety specifications and critical properties of CPSs, understand abstraction and system architectures, learn how to design by invariant, reason rigorously about CPS models, verify CPS models of appropriate scale, understand the semantics of a CPS model and develop an intuition for operational effects. Students will write hybrid programs (HPs), which capture relevant dynamical aspects of CPSs in a simple programming language with a simple semantics, allowing the programmer to refer to real-valued variables representing real quantities and specify their dynamics as part of the HP.
- dcvsl.pdf
-
- Differential logic - semanticweb.org.edu
-
- 【abstract algebra】左逆,右逆,可逆(一) - 数学系本科の生活札记 - 知乎专栏
- 知乎专栏
- Joachim Lambek - Wikipedia, the free encyclopedia
-
- Categorial grammar - Wikipedia, the free encyclopedia
-
- Microsoft PowerPoint - 2014-01-15 Challenges in Massive Concurrency (Oxford) - Clean.pptx - 2014-01-15 Challenges in Massive Concurrency (Oxford).pdf
-
- Microsoft PowerPoint - 2012-05-12 MacQueen Fest (Chicago).pptx - 2012-05-12 MacQueen Fest (Chicago).pdf
-
- Reversible Structures - 2011-09-22 Reversible Structures (CMSB 11) Cosimo.pdf
-
- Reversibility in massive concurrent systems - 2011-08-23 Reversible Structures (MeCBIC 11) Cosimo.pdf
-
- Microsoft PowerPoint - Continuous Markovian Logic - 2011-09-15 Continuous Markovian Logic (CSL Mardare).pdf
-
- Diapositiva 1 - 2011-07-07 Modular Markovian Logic (ICALP) Mardare.pdf
-
- Microsoft PowerPoint - 2012-05-25 Speaking the Language of Molecules (Dublin).pptx - 2012-05-25 Speaking the Language of Molecules (Dublin).pdf
-
- Microsoft PowerPoint - 2012-03-07 Molecular Programming \(ISAT Workshop\).pptx - 2012-03-07 Molecular Programming (ISAT Workshop).pdf
-
- Microsoft PowerPoint - 2011-11-18 Molecular Programming (INRIA Scientific Board) (Short).pptx - 2011-11-18 Molecular Programming (INRIA Scientific Board) (Short).pdf
-
- Microsoft PowerPoint - 2011-07-13 Speaking the Language of Molecules \(CISBIO Open Day\).pptx - 2011-07-13 Speaking the Language of Molecules (CISBIO Open Day).pdf
-
- Microsoft PowerPoint - 2011-05-26 Speaking the Language of Molecules (Sophia Antipolis).pptx - 2011-05-26 Speaking the Language of Molecules (Sophia Antipolis).pdf
-
- Microsoft PowerPoint - 2011-05-06 Speaking the Language of Molecules (BioBits Turin).pptx - 2011-05-06 Speaking the Language of Molecules (BioBits Turin).pdf
-
- Microsoft PowerPoint - 2010-11-16 Speaking the Language of Molecules (UW).pptx - 2010-11-16 Speaking the Language of Molecules (UW).pdf
-
- Microsoft PowerPoint - 2010-07-02 Pi in the Sky (CiE Ponta Delgada).pptx - 2010-07-02 Pi in the Sky (CiE Ponta Delgada).pdf
-
- Microsoft PowerPoint - 2010-03-23 Pi in the Sky (Torino).pptx - 2010-03-23 Pi in the Sky (Torino).pdf
-
- Microsoft PowerPoint - 2009-12-04 Pi in the Sky (Imperial Lecture).pptx - 2009-12-04 Pi in the Sky (Imperial Lecture).pdf
-
- Microsoft PowerPoint - 2009-09-05 Pi in the Sky (MeCBIC Bologna).pptx - 2009-09-05 Pi in the Sky (MeCBIC Bologna).pdf
-
- Processes_in_Space_(AMS).pdf - Processes in Space (CiE).pdf
-
- Luca Cardelli
-
- Slide 1 - 2007-12-10 L'Inria a Quarante Ans.pdf
-
- Microsoft Office PowerPoint 2003 Beta - Globality (ETAPS 2001).ppt - 2001-04 Globality (ETAPS).pdf
-
- Microsoft Office PowerPoint 2003 Beta - A Query Language Based on the Ambient Logic.ppt - 2001-07-06 A Query Language Based on the Ambient Logic.pdf
-
- 2000-09-21 Global Computing Meeting (Edinburgh).pdf
-
- Microsoft PowerPoint - Mobility and Spatial Logics - 01 - Mobility.ppt - Mobility and Spatial Logics - 01 - Mobility (Bertinoro).pdf
-
- Microsoft Office PowerPoint 2003 Beta - Mobility and Spatial Logics - 01 - Mobility.ppt - 2002-03 Agay School 01 - Mobility.pdf
-
- Microsoft Office PowerPoint 2003 Beta - 2000-01 Anytime Anywhere (POPL).ppt - 2000-01 Anytime Anywhere (POPL).pdf
-
- Modal Logics (MSRC 7m23d99).fm - 1999-07-23 Anytime Anywhere (Informal) (Microsoft).A4.pdf
-
- Modal Logics (Edinburgh 6m15d99).fm - 1999-06-15 Anytime Anywhere (Edinburgh).pdf
-
- 1997-01 Program Fragments Linking and Modularization (POPL).pdf
-
- 1997-01 Objects Classes Abstractions (FOOL).pdf
-
- 1997-03 Object Based Features (Berkeley).pdf
-
- EverythingIsAnObject Talk.book - 1997-06 Everything is an Object (ECOOP Prototypes Workshop).pdf
-
- 1997-08-04..15 A Theory of Objects (Sydney Minicourse).pdf
-
- Full Talk.book - 1997-06 A Theory of Object (LICS).pdf
-
- ECOOP'97 Tutorial.book - 1997-06 A Theory of Object (ECOOP Tutorial).pdf
-
- 1996-10 A Theory of Objects (OOPSLA Tutorial).pdf
-
- 1996-05 Class-based vs Object-based Languages (PLDI Tutorial).pdf
-
- 1997-03-25 Ambit Minitalk 2 (SRC).pdf
-
- 1996-11-26 Ambit Minitalk 1 (SRC).pdf
-
- 1996-05 Foundatoins of Object Oriented Programming.pdf
-
- 1995-10-13 Foundations of Object Oriented Programming (Horizon Day).pdf
-
- 1995-08 On Subtyping and Matching (ECOOP ATCS).pdf
-
- 1995-08 Operationally Sound Update (HOOTS).pdf
-
- C:\Documents and Settings\luca\My Documents\Talks\Research\1995-05 (FASE)\FASESlides.ps - 1995-05 An Imperative Object Calculus (FASE).pdf
-
- 1994-07 Object Types with Self (FOOL).pdf
-
- 1994-07 ML 2000 Meeting, Talk on Objects (Princeton).pdf
-
- 1994-05 A Theory of Primitive Objects (ESOP).pdf
-
- 1992-01 Typed Foundations of Object Oriented Programming (POPL).pdf
-
- Full page fax print - 1989-04-18..28 Typeful Programming.pdf
-
- 1998-10 Semantic Methods for Object Oriented Languages (OOPSLA).pdf
-
- Full page photo - 1985-08 Persistence and Type Abstraction.pdf
-
- Papers We Love
- A repository of computer science papers and a community of people who love reading them
- marginalia -- Marginalia
- lightweight literate programming for clojure -- inspired by [docco](http://jashkenas.github.com/docco/)
- fogus: Everyone’s “agile”
- Pseudo-random ramblings from Fogus.
- Language Implementation Patterns: Create Your Own Domain-Specific and General Programming Languages (Pragmatic Programmers): Terence Parr: 9781934356456: Amazon.com: Books
- Language Implementation Patterns: Create Your Own Domain-Specific and General Programming Languages (Pragmatic Programmers) [Terence Parr] on Amazon.com. *FREE* shipping on qualifying offers. Learn to build configuration file readers, data readers, model-driven code generators, source-to-source translators
- haskell - Generic programming via effects - Stack Overflow
-
- Union Find - UnionFind.pdf
-
- Syntax! | A research blog about programming languages, formal logics, software development and their interactions, by Matthias Puech.
- A research blog about programming languages, formal logics, software development and their interactions, by Matthias Puech.
- [1511.04834] Neural Programmer: Inducing Latent Programs with Gradient Descent
-
- [1511.06279] Neural Programmer-Interpreters
-
- (1) Round 1 Seattle
- Round 1 Seattle. 1,370 likes · 244 talking about this · 12,648 were here. Round 1 Entertainment offers bowling, karaoke, billiards, arcade games, darts,...
- eqsat_tate_lmcs11.pdf
-
- Static Program Analysis
-
- 虹蛇 - THBWiki · 专业性的东方Project中文维基百科 - TBSGroup
-
- Web & AI | AITopics
-
- Computer Science | AITopics
- AAAI's AITopics explores the relationship between Computer Science and AI.
- AI Overview | AITopics
- Artificial Intelligence is the scientific understanding of the mechanisms underlying thought and intelligent behavior and their embodiment in machines. AAAI's AITopics AI Overview is a great place to embark upon an exciting journey exploring AI.
- Applications | AITopics
- AAAI's AITopics Applications pages summarize AI application areas and highlight some of the exciting systems. Artificial intelligence is a part of everyday life in industrialized nations, helping people in every field make better use of information to work smarter, not harder.
- Cognitive Science | AITopics
- Cognitive Science lies in the intersection of psychology, linguistics, computer science, philosophy, and physiology. AAAI's AITopics explores using AI to augment human thinking and to understand how humans think.
- Education | AITopics
- AAAI's AITopics explores AI's role in the classroom.
- Games & Puzzles | AITopics
- AAAI's AITopics highlights Games and Puzzles that challenge problem-solving skills. AI programs have beaten human champions at checkers, chess, Jeopardy!, and other games.
- History | AITopics
- AAAI's AITopics shows the chronology of Artificial Intelligence, with articles of historical interest. Includes early machines and studies of human intelligence.
- Interfaces | AITopics
- AAAI's AITopics explores AI techniques for a new style of human-computer interaction, where the computer becomes an intelligent, active, personalized collaborator.
- Machine Learning | AITopics
- AAAI's AITopics Machine Learning explores how we can build computer systems that automatically improve with experience, and what are the fundamental laws that govern all learning processes.
- Natural Language | AITopics
- AAAI's AITopics explores Natural Language Processing to enable communication between people and computers and automatic translation to enable people to interact easily with others around the world. Easily understandable information on progress towards both goals.
- Philosophy | AITopics
- AAAI's AITopics explores the connections between AI and philosophy. Philosophical foundations of AI include explorations of reasoning, ethics, knowledge, and language, and include arguments about the impossibility of AI.
- Representation & Reasoning | AITopics
- AAAI's AITopics explores the problem of knowledge representation – finding adequate, efficient languages for describing the world – and reasoning methods in AI systems -- formal logic, informal inference, search, ...
- Robots | AITopics
- Robots integrate human capabilities, including motion, perception and reasoning. AAAIs AITopics explores robotics applications (e.g., in manufacturing and space), history, research and more.
- Science Fiction | AITopics
- AAAI's AITopics explores the intersection of artificial intelligence and science fiction includes sci fi books, movies, authors.
- Speech | AITopics
- AAAI's AITopics explores speech -- recognition, understanding, synthesis. Computers that converse with people must interpret and generate the acoustic signals of spoken language.
- Systems & Languages | AITopics
- AAAI's AITopics explores systems & programming languages used for AI. Improved computer speed and understanding of core AI concepts like search, planning, learning and natural language make it possible to build practical systems to perform tasks that require intelligence.
- Vision | AITopics
- AAAIs AITopics explores AI vision technology for image stabilization, 3D modeling, image synthesis, surgical navigation, handwriting recognition, vision-based interfaces and more.
- Bird–Meertens formalism - Wikipedia, the free encyclopedia
-
- BMF.pdf
-
- Fun with the Lazy State Monad | Melding Monads
- The lazy state monad doesn't work the way you think it works. Thinking of the lazy state monad in terms of imperative programming is a very useful first approximation, at least in terms of what is computed, but in terms how things are computed this intuition is beyond useless. I hope to dissuade you of…
- Melding Monads | Math, Computer Science, and Education
- Math, Computer Science, and Education
- CiteSeerX — Linear-time breadth-first tree algorithms: An exercise in the arithmetic of folds and zips
- CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): . This paper is about an application of the mathematics of the zip, reduce (fold) and accumulate (scan) operations on lists. It gives an account of the derivation of a linear-time breadth-first tree traversal algorithm, and of a subtle and efficient breadth-first tree labelling algorithm. Keywords. Derivation, functional programming, breadth-first, traversal, labelling. 1 Introduction The algorithms which are developed in this paper relate trees to sequences in a way that respects the breadth-first ordering of the nodes of the tree: nodes nearer the root are earlier in the ordering, and nodes on the same level are ordered from left to right. We distinguish between finite and infinite sequences, which we call lists and streams respectively. Lists of elements of type ff are modelled as the least solution list.ff of the equation list.ff = [ ] j ff :: list.ff That is, the empty list [ ] has type list.ff , and if x has type ff and xs has type list.ff then x :: xs has type list.ff . We...
- Monads
- Monads in Haskell and other languages
- hp07.pdf
-
- Are continuations really the mother of all monads? | Melding Monads
- So Issue 14 of the Monad Reader is out, which includes my paper "Lloyd Allison's Corecursive Queues" with a few significant revisions. Compared to earlier versions mentioned on this blog, I moved a few sections around to improve the flow: the first 8 pages now contain an uninterrupted informal derivation of the queue operators. I…
- Lawvere theory in nLab
-
- Conal Elliott » Can functional programming be liberated from the von Neumann paradigm?
-
- Conal Elliott » Tangible Functional Programming: a modern marriage of usability and composability
-
- Conal Elliott » Why program with continuous time?
-
- McCarthy-original-LISP-paper-recursive.pdf
-
- Dataless programming
-
- Zero谈数学——聊聊拓扑(1) - DivisionByZero - 知乎专栏
- 知乎专栏
- PaneRatanamahatanaMyers.f - PaneRatanamahatanaMyers00.pdf
-
- Ko2004LearningBarriers.pdf
-
- Microsoft Word - FCAD2008.doc - FCAD2008.pdf
-
- ValueRestriction
-
- LtU Classic Archives
-
- Hopl2.pdf
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- LtU Classic Archives
-
- The Encyclopedia of Human-Computer Interaction, 2nd Ed. » Interaction Design Foundation
- The Encyclopedia of Human-Computer Interaction, 2nd Ed.. Free textbooks written by 100+ leading designers, bestselling authors and Ivy League professors. The textbooks are assembled in a gigantic 4000+ page encyclopedia covering the design of interactive products and services like websites, household objects, smartphones, computer software, aircraft cockpits, you name it.
- Evolutionary psychology - Wikipedia, the free encyclopedia
-
- Inheritance.pdf
-
- [1604.03640v1] Bridging the Gaps Between Residual Learning, Recurrent Neural Networks and Visual Cortex
-
- Mechanisms Gating the Flow of Information in the Cortex: What They Might Look Like and What Their Uses may be
-
- pothos - Google Search
-
- 【東方Vocal】【IOSYS】 Rampant Blaze_其他_音乐_bilibili_哔哩哔哩弹幕视频网
- youtube 的Nitori Kappashiro为视频原作者。封面图ID44528345,视频图片地址http://konachan.com/post/show/169095。原曲:神々が恋した幻想郷/芥川龍之介の河童 ~ Candid Friend。Vocal: 愛原千尋。Lyrics:夕野ヨシミ (ゆうの よしみ)。Composer: Keigo Kanzaki 「神咲ケイゴ (かんざき けいご)」
- 哔哩哔哩弹幕视频网 - ( ゜- ゜)つロ 乾杯~ - bilibili
- bilibili是国内知名的视频弹幕网站,这里有最及时的动漫新番,最棒的ACG氛围,最有创意的Up主。大家可以在这里找到许多欢乐。
- Valentin Turchin - Wikipedia, the free encyclopedia
-
- Metasystem transition - Wikipedia, the free encyclopedia
-
- Refal - Wikipedia, the free encyclopedia
-
- U-CSE-201215.pdf
-
- Multi-dimensional logic programming: theoretical foundations
-
- Monad Transformers Step by Step - catamorph.de
- Personal home page and blog of Martin Grabmüller.
- What I Wish I Knew When Learning Haskell 2.3 ( Stephen Diehl )
-
- Multicategory - Wikipedia, the free encyclopedia
-
- multicategory in nLab
-
- () - 1502.05561.pdf
-
- Zipper - HaskellWiki
-
- Haskell/Zippers - Wikibooks, open books for an open world
-
- Incremental λ-Calculus
-
- This is What Happens When Deep Learning Neural Networks Hallucinate - The New Stack
-
- esop99.pdf
-
- FMP02-sub.pdf
-
- modalmodel.pdf
-
- The Theory of Concatenative Combinators
-
- Towards platform-agnostic interruptibility : Inside 736-131
-
- Interrupting GHC : Inside 736-131
-
- You could have invented zippers : Inside 736-131
-
- S0273-0979-03-00981-9.pdf
-
- LNCS 8410 - An Array-Oriented Language with Static Rank Polymorphism - rank-polymorphism.pdf
-
- MuscheviciPotaninTemperoNobleOOPSLA2008.pdf
-
- Modular Statically Typed Multimethods - iandc.pdf
-
- VanRoyChapter.pdf
-
- logpolpro.pdf
-
- New papers dividing logical uncertainty into two subproblems - Machine Intelligence Research Institute
-
- [1604.06057] Hierarchical Deep Reinforcement Learning: Integrating Temporal Abstraction and Intrinsic Motivation
-
- Association for Computational Learning | Computational Learning Theory
-
- [1512.05023] Packet Transactions: High-level Programming for Line-Rate Switches
-
- Jean Gallier's Home Page for logic book
-
- Logic in Computer Science: Modelling and Reasoning about Systems: Michael Huth, Mark Ryan: 9780521543101: Amazon.com: Books
- Buy Logic in Computer Science: Modelling and Reasoning about Systems on Amazon.com ✓ FREE SHIPPING on qualified orders
- Frank Pfenning
- Frank Pfenning Personal Home Page
- Notes.pdf
-
- 1412.6781.pdf
-
- Sentential Calculi pages-Home Page
-
- 32_3_6.pdf
-
- Solution of the Robbins Problem
-
- [0707.0926] Theorem proving support in programming language semantics
-
- lessadhoc-extended.pdf
-
- 脑机接口的研究进展到什么程度了? - ShiningObsidian的文章 - 知乎专栏
- 知乎专栏
- AmiAmi [Character & Hobby Shop] | Touhou Project - Remilia Scarlet [Koumajou Densetsu Ver.] 1/8 Complete Figure(Pre-order)
-
- What is the significance of Tarski's Undefinability Theorem? (x-post from /r/askphilosophy) : logic
- My original post here (https://www.reddit.com/r/askphilosophy/comments/4g21od/what_is_the_philosophical_significance_of_tarskis/) didn't receive...
- haskell - Zygomorphisms and Futumorphisms specialised to lists - Stack Overflow
-
- Formalization of the Area Method in the Coq Proof assisant.
-
- Bad ideas - dc49b85196aaa6715dd46843d9dcffa38358.pdf
-
- Category Theory for Promises/A+ - BAM Weblog
-
- ghc-rts.pdf
-
- Generating Compiler Optimizations from Proofs
-
- sirkku.net
- the str⑨ngest server
- malevole - Programming Language Inventor or Serial Killer?
- Can you tell a coder from a cannibal ? Try to work out which of the following spent their time hacking computers, and which preferred hacking away at corpses instead.
- Adjunctions | Bartosz Milewski's Programming Cafe
- This is part 18 of Categories for Programmers. Previously: It's All About Morphisms. See the Table of Contents. In mathematics we have various ways of saying that one thing is like another. The strictest is equality. Two things are equal if there is no way to distinguish one from another. One can be substituted for…
- The Unlambda Programming Language
- Description of the Unlambda Programming Language
- Towards Formal Foundations of Agda's Data Types - AIM23-talk.pdf
-
- indind_csl2010.pdf
-
- Extreme Style Machines: Using Random Neural Networks to Generate Textures | nucl.ai
-
- QA.pdf
-
- SmithThompson Final - Pat Thompson paper 1.pdf
-
- adt-functors.pdf
-
- 24-Nogueira-WhenIsAnADTAFunctor.pdf
-
- BirdMeertens98Nested.pdf
-
- tfp-structures-orchard12.pdf
-
- Spring School on Generic and Indexed Programming
-
- The ACG Homepage
-
- The Formal Semantics of Programming Languages | The MIT Press
-
- Generic Programming with Adjunctions - Slides.pdf
-
- tdpe-ln.pdf
-
- Typelogical Grammar (Stanford Encyclopedia of Philosophy)
-
- Natural Language Semantics
- Linguistics papers and talks, often about applications of delimited continuations to formal semantics and pragmatics
- Sharing and Common Subexpression Elimination in EDSL compilation
- Lecture notes, in the form of the commented code, for the distilled tutorial on implicit and explicit sharing in the embedded DSL compilation. The tutorial was presented at DSL 2011: IFIP Working Conference on Domain-Specific Languages. 6-8 September 2011, Bordeaux, France.
- BUGS in Writing, Revised Edition: A Guide to Debugging Your Prose (2nd Edition): Lyn Dupre: 9780201379211: Amazon.com: Books
- BUGS in Writing, Revised Edition: A Guide to Debugging Your Prose (2nd Edition) [Lyn Dupre] on Amazon.com. *FREE* shipping on qualifying offers. How often does a book come along that has you laughing out loud as it improves your writing, especially of technical and scientific material? How often does a book on writing come out aimed at scientists
- Beauty Is Our Business: A Birthday Salute to Edsger W. Dijkstra (Monographs in Computer Science): Wim Feijen, A.J.M. van Gasteren, David Gries, J. Misra: 9781461287926: Amazon.com: Books
- Buy Beauty Is Our Business: A Birthday Salute to Edsger W. Dijkstra (Monographs in Computer Science) on Amazon.com ✓ FREE SHIPPING on qualified orders
- Causal Commutative Arrows and Their Optimization | The Yale Haskell Group
-
- Programming with angelic nondeterminism - popl-2010.pdf
-
- The Calculus of Computation - Decision Procedures with | Aaron R. Bradley | Springer
- Computational logic is a fast-growing field with applications in artificial intelligence, constraint solving, and the design and verification of software
- CoqDevelopment/Roadmap86 - Cocorico!
-
- Edgar Simo-Serra - Sketch Simplification
- We present a novel technique to simplify sketch drawings based on learning a series of convolution operators. In contrast to existing approaches that require vector images as input, we allow the more general and challenging input of rough raster sketches such as those obtained from scanning pencil sketches. We convert the rough sketch into a simplified version which is then amendable for vectorization. This is all done in a fully automatic way without user intervention. Our model consists of a fully convolutional neural network which, unlike most existing convolutional neural networks, is able to process images of any dimensions and aspect ratio as input, and outputs a simplified sketch which has the same dimensions as the input image. In order to teach our model to simplify, we present a new dataset of pairs of rough and simplified sketch drawings. By leveraging convolution operators in combination with efficient use of our proposed dataset, we are able to train our sketch simplification model. Our approach naturally overcomes the limitations of existing methods, e.g., vector images as input and long computation time; and we show that meaningful simplifications can be obtained for many different test cases. Finally, we validate our results with a user study in which we greatly outperform similar approaches and establish the state of the art in sketch simplification of raster images.
- The FOM Archives
-
- FOM Info Page
-
- Truth, Proof and Gödelian Arguments: A Defence of Tarskian Truth in Mathematics - PANTPA
-
- SETS FOR MATHEMATICS - Sets for Mathematics.pdf
-
- jonesgomardsestoft-a4.pdf
-
- Yaxu: Spicule on PledgeMusic
- Algorithmic, hyperreal, broken techno.
- Bound - School of Haskell | School of Haskell
-
- Safebooru - blonde hair bow broom broom riding from behind hat kirisame marisa kneehighs large bow mary janes myama night night sky rooftop shoes sky solo star star (sky) starry sky sunset touhou white legwear witch hat | 106424
- Safebooru is a anime and manga picture search engine, images are being updated hourly.
- Safebooru - 1girl apron grab blonde hair clothes grab highres kirisame marisa no hat poprication sad simple background solo tears touhou white background yellow eyes | 1069922
- Safebooru is a anime and manga picture search engine, images are being updated hourly.
- [Touhou hand-drawn][Eng-subbed]Sexual Reimu : Gensokyo
- reddit: the front page of the internet
- MIT-LCS-TR-131.pdf
-
- Cakes, Custard and Category Theory: Easy recipes for understanding complex maths: Amazon.co.uk: Eugenia Cheng: 9781781252871: Books
- Buy Cakes, Custard and Category Theory: Easy recipes for understanding complex maths by Eugenia Cheng (ISBN: 9781781252871) from Amazon's Book Store. Free UK delivery on eligible orders.
- How to Bake Pi: An Edible Exploration of the Mathematics of Mathematics: Eugenia Cheng: 9780465051717: Amazon.com: Books
- Buy How to Bake Pi: An Edible Exploration of the Mathematics of Mathematics on Amazon.com ✓ FREE SHIPPING on qualified orders
- Papers of Greg Morrisett
-
- Chris Double's Radio Weblog
-
- SATMC: a SAT-based Model-Checker for Security Protocols
- SATMC Home Page
- Smalltalk Best Practice Patterns
-
- The Reitaisai 13 "I totally didn't forget it was this weekend" Resource Thread : TOUHOUMUSIC
- Hey, it's Reitaisai again, it's May, the sky is blue, the grass is green, we aren't freezing to death and there's new Touhou music. We here at...
- ZUN's new album, Dr. Lantecy's Freak Report, is out from Reitaisai 13! : touhou
- reddit: the front page of the internet
- 【自制魔改补丁】东方耻礼殿完整版fa布_东方吧_百度贴吧
-
- Ross-AIStats11-NoRegret.pdf
-
- popl2014.pdf
-
- sas2012.pdf
-
- Reasoning about Idealized ALGOL Using Regular Languages - Springer
-
- Full abstraction for Idealized Algol with passive expressions
-
- The Craft of Research, Third Edition (Chicago Guides to Writing, Editing, and Publishing): Wayne C. Booth, Gregory G. Colomb, Joseph M. Williams: 9780226065663: Amazon.com: Books
- Buy The Craft of Research, Third Edition (Chicago Guides to Writing, Editing, and Publishing) on Amazon.com ✓ FREE SHIPPING on qualified orders
- farewell-to-frp
-
- ThePowerOfPi.pdf
-
- Subtypes for Free!
-
- Odersky: The Trouble with Types - Strange Loop 2013 [InfoQ] : haskell
- reddit: the front page of the internet
- Lisp, the Universe and Everything: European Lisp Symposium 2016
-
- EWD 316 - EWD316.PDF
-
- A Reformulation Strategy for Multi-Dimensional CSPs: The Case Study of the SET Game - viewcontent.cgi
-
- np/ling: LINear LaNGuage: Type Theory and Process Calculi for Distributed and High-precision programming
- ling - LINear LaNGuage: Type Theory and Process Calculi for Distributed and High-precision programming
- accelerate: An embedded language for accelerated array processing | Hackage
-
- A Truly Integrated Functional Logic Language [CurryWiki]
-
- lecture1.pdf
-
- A Brief ACL2 Tutorial
-
- Parametricity and Local Variables - viewcontent.cgi
-
- The convergence of compilers, build systems and package managers : Inside 736-131
-
- No grammar? No problem! : Inside 736-131
-
- The AST Typing Problem : Inside 736-131
-
- Category theory for loop optimizations : Inside 736-131
-
- Data is Code : Inside 736-131
-
- SPLS June 2005
-
- modal-types-for-mobile-code.pdf
-
- lics.dvi - short.pdf
-
- popl96.pdf
-
- The Duality of Object and Event references
- This article describes an interesting example of mathematical duality in programming languages - the duality between references between objects and references between events. The idea is useful for understading what events are garbage and can be garbage collected.
- Semantic Domain: Löb's theorem is (almost) the Y combinator
-
Bookmarks Toolbar
- Add bookmarks to this folder to see them displayed on the Bookmarks Toolbar
- Most Visited
- Philip Guo
Unsorted Bookmarks
- Memoization in Rust? - help - The Rust Programming Language Forum
- I'm trying to pass a mutable hashmap to a function which calls itself recursively. Any help getting this working would be much appreciated, or if you could just show an example of memoization in Rust, that would help. …
- Play no-one has to die. mobile free
- Play no-one has to die. mobile free - Four people are trapped in the middle of a building fire and it's up to you to save them while unravelling a greater mystery.
DESIGN- Stuart Madafiglio
ART- Cindy Xu
MUSIC- Jesse Valentine
- JR.dvi - JR.pdf
-
- https://catalyst.uw.edu/catalyst/uw/4b6457fe9095a8b5be488c5fc2e03afa
-
- tele-TASK Video: Programming and Scaling
-